Pages that link to "Item:Q1090455"
From MaRDI portal
The following pages link to The complexity of combinatorial problems with succinct input representation (Q1090455):
Displaying 50 items.
- Explainable AI using MAP-independence (Q2146024) (← links)
- The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference (Q2206456) (← links)
- Handling and measuring inconsistency in non-monotonic logics (Q2211858) (← links)
- Open-world probabilistic databases: semantics, algorithms, complexity (Q2238646) (← links)
- The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws (Q2283277) (← links)
- Subroutines in P systems and closure properties of their complexity classes (Q2285669) (← links)
- Complexity results for probabilistic answer set programming (Q2302961) (← links)
- On the complexity of inconsistency measurement (Q2321337) (← links)
- Monomials in arithmetic circuits: complete problems in the counting hierarchy (Q2353185) (← links)
- A complexity theory for feasible closure properties (Q2366687) (← links)
- Same-decision probability: a confidence measure for threshold-based decisions (Q2375339) (← links)
- Characterising the complexity of tissue P systems with fission rules (Q2403238) (← links)
- The effect of combination functions on the complexity of relational Bayesian networks (Q2409113) (← links)
- The minimum oracle circuit size problem (Q2410683) (← links)
- Quantum and classical complexity classes: Separations, collapses, and closure properties (Q2486397) (← links)
- A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
- Most frugal explanations in Bayesian networks (Q2512987) (← links)
- On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant (Q2514144) (← links)
- Subtractive reductions and complete problems for counting complexity classes (Q2566034) (← links)
- Relativized counting classes: Relations among thresholds, parity, and mods (Q2638771) (← links)
- The complexity of searching implicit graphs (Q2676567) (← links)
- Motivating explanations in Bayesian networks using MAP-independence (Q2677844) (← links)
- Lower bounds against sparse symmetric functions of ACC circuits: expanding the reach of \#SAT algorithms (Q2701071) (← links)
- Solution-Graphs of Boolean Formulas and Isomorphism (Q2817999) (← links)
- On Stopping Evidence Gathering for Diagnostic Bayesian Networks (Q3011944) (← links)
- Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth (Q3012845) (← links)
- SeparatingPH fromPP by relativization (Q4025322) (← links)
- On the power of deterministic reductions to C=P (Q4032933) (← links)
- Immunity and Simplicity for Exact Counting and Other Counting Classes (Q4265536) (← links)
- Generalized theorems on relationships among reducibility notions to certain complexity classes (Q4298368) (← links)
- On the complexity of graph reconstruction (Q4298372) (← links)
- Restrictive Acceptance Suffices for Equivalence Problems (Q4504964) (← links)
- The complexity of approximating PSPACE-complete problems for hierarchical specifications (Q4630250) (← links)
- The complexity of searching succinctly represented graphs (Q4645179) (← links)
- Bounded queries to arbitrary sets (Q4717045) (← links)
- On the power of generalized Mod-classes (Q4864444) (← links)
- Relationships among $PL$, $\#L$, and the determinant (Q4889814) (← links)
- (Q5005153) (← links)
- Solution-Graphs of Boolean Formulas and Isomorphism1 (Q5015600) (← links)
- On matroids and hierarchical graphs (Q5056114) (← links)
- Graph isomorphism is low for PP (Q5096798) (← links)
- (Q5111236) (← links)
- THE OPERATORS MIN AND MAX ON THE POLYNOMIAL HIERARCHY (Q5249042) (← links)
- A relationship between difference hierarchies and relativized polynomial hierarchies (Q5289273) (← links)
- QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES (Q5696941) (← links)
- Counting classes: Thresholds, parity, mods, and fewness (Q5905584) (← links)
- Graph Ramsey theory and the polynomial hierarchy (Q5943091) (← links)
- Dot operators (Q5958134) (← links)
- On counting propositional logic and Wagner's hierarchy (Q6100184) (← links)
- On measuring inconsistency in definite and indefinite databases with denial constraints (Q6161468) (← links)
