Pages that link to "Item:Q584250"
From MaRDI portal
The following pages link to The strong exponential hierarchy collapses (Q584250):
Displayed 22 items.
- The strong exponential hierarchy collapses (Q584250) (← links)
- Probabilistic polynomial time is closed under parity reductions (Q751270) (← links)
- Kolmogorov characterizations of complexity classes (Q804291) (← links)
- The complexity of Kemeny elections (Q817813) (← links)
- \(P^{NP[O(\log n)]}\) and sparse turing-complete sets for NP (Q908700) (← links)
- On truth-table reducibility to SAT (Q1173957) (← links)
- Bounded queries to SAT and the Boolean hierarchy (Q1178690) (← links)
- Polynomial-time compression (Q1198955) (← links)
- Succinctness as a source of complexity in logical formalisms (Q1302307) (← links)
- Census techniques collapse space classes (Q1332770) (← links)
- Separating classes in the exponential-time hierarchy from classes in PH (Q1365687) (← links)
- On parallel hierarchies and \(R_k^i\) (Q1377627) (← links)
- Tally NP sets and easy census functions. (Q1854340) (← links)
- Bounded queries, approximations, and the Boolean hierarchy (Q1854449) (← links)
- Optimal series-parallel trade-offs for reducing a function to its own graph (Q1854508) (← links)
- Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP (Q3374757) (← links)
- On the power of deterministic reductions to C=P (Q4032933) (← links)
- Generalized theorems on relationships among reducibility notions to certain complexity classes (Q4298368) (← links)
- COMPUTATIONAL COMPLEXITY OF GENERATORS AND NONGENERATORS IN ALGEBRA (Q4791998) (← links)
- On computing Boolean connectives of characteristic functions (Q4835862) (← links)
- Upper bounds for the complexity of sparse and tally descriptions (Q4864446) (← links)
- Weak cardinality theorems (Q5718691) (← links)