Pages that link to "Item:Q1241440"
From MaRDI portal
The following pages link to Complete sets and the polynomial-time hierarchy (Q1241440):
Displayed 50 items.
- Index sets and presentations of complexity classes (Q1366536) (← links)
- On the power of alternation on reversal-bounded alternating Turing machines with a restriction (Q1390864) (← links)
- Nondeterministic stack register machines (Q1391527) (← links)
- Deterministic summation modulo \(\mathcal B_{n}\), the semigroup of binary relations on \(0,1, \dots, n-1\) (Q1392020) (← links)
- Some connections between bounded query classes and non-uniform complexity. (Q1426008) (← links)
- The closure of monadic NP (Q1577017) (← links)
- Understanding the complexity of axiom pinpointing in lightweight description logics (Q1680678) (← links)
- Definability, decidability, complexity (Q1817073) (← links)
- Coherence in finite argument systems. (Q1852853) (← links)
- Complexity results for modal dependence logic (Q1956378) (← links)
- The complexity of problems for quantified constraints (Q1959381) (← links)
- The robustness of LWPP and WPP, with an application to graph reconstruction (Q2027204) (← links)
- Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\) (Q2087770) (← links)
- Complexity of the multilevel critical node problem (Q2121476) (← links)
- Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting (Q2321294) (← links)
- Hitting all maximal independent sets of a bipartite graph (Q2354017) (← links)
- On the computational complexity of defining sets (Q2387433) (← links)
- Parameterized complexity classes beyond para-NP (Q2396719) (← links)
- A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison (Q2404077) (← links)
- Reasoning about non-immediate triggers in biological networks (Q2426107) (← links)
- Perfect correspondences between dot-depth and polynomial-time hierarchies (Q2453555) (← links)
- Computational methods for database repair by signed formulae (Q2502158) (← links)
- Error-bounded probabilistic computations between MA and AM (Q2507698) (← links)
- Subtractive reductions and complete problems for counting complexity classes (Q2566034) (← links)
- All superlinear inverse schemes are coNP-hard (Q2575753) (← links)
- Resource bounded immunity and simplicity (Q2576870) (← links)
- The complexity of online manipulation of sequential elections (Q2637642) (← links)
- Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting (Q2667819) (← links)
- Axiomatizing physical experiments as oracles to algorithms (Q2941593) (← links)
- Improving Strategies via SMT Solving (Q3000582) (← links)
- Efficient Probabilistically Checkable Debates (Q3088122) (← links)
- Characterising equilibrium logic and nested logic programs: Reductions and complexity, (Q3181745) (← links)
- On polynomial-time truth-table reducibility of intractable sets to P-selective sets (Q3210177) (← links)
- On the Containment Problem for Linear Sets (Q3304154) (← links)
- Relativized polynomial hierarchies extending two levels (Q3331211) (← links)
- The role of rudimentary relations in complexity theory (Q3347299) (← links)
- Weighted Boolean Formula Games (Q3464467) (← links)
- Characterizing polynomial complexity classes by reducibilities (Q3489449) (← links)
- Complexity of Counting the Optimal Solutions (Q3511323) (← links)
- Reasoning with different levels of uncertainty (Q3643259) (← links)
- The polynomial hierarchy and a simple model for competitive analysis (Q3716806) (← links)
- A second step toward the strong polynomial-time hierarchy (Q3816982) (← links)
- A note on complete sets and transitive closure (Q3959428) (← links)
- Immunity and Simplicity for Exact Counting and Other Counting Classes (Q4265536) (← links)
- COMPUTATIONAL COMPLEXITY OF GENERATORS AND NONGENERATORS IN ALGEBRA (Q4791998) (← links)
- A refinement of the low and high hierarchies (Q4841766) (← links)
- On balanced versus unbalanced computation trees (Q4887490) (← links)
- UP and the low and high hierarchies: A relativized separation (Q4895813) (← links)
- (Q5005153) (← links)
- (Q5005160) (← links)