Pages that link to "Item:Q3832043"
From MaRDI portal
The following pages link to The Boolean Hierarchy II: Applications (Q3832043):
Displayed 32 items.
- Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games (Q314437) (← links)
- The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
- The strong exponential hierarchy collapses (Q584250) (← links)
- Lower bounds and the hardness of counting properties (Q703531) (← links)
- New developments in structural complexity theory (Q913509) (← links)
- Lower bounds for constant-depth circuits in the presence of help bits (Q917289) (← links)
- On the complexity of test case generation for NP-hard problems (Q917311) (← links)
- The 1-versus-2 queries problem revisited (Q970102) (← links)
- Exact complexity of exact-four-colorability (Q1014384) (← links)
- The three-color and two-color Tantrix\(^{\text{TM}}\) rotation puzzle problems are NP-complete via parsimonious reductions (Q1041029) (← links)
- On truth-table reducibility to SAT (Q1173957) (← links)
- Separating complexity classes with tally oracles (Q1185002) (← links)
- The random oracle hypothesis is false (Q1333397) (← links)
- Universally serializable computation (Q1384538) (← links)
- A second step towards complexity-theoretic analogs of Rice's Theorem (Q1575716) (← links)
- Commutative queries (Q1854422) (← links)
- Bounded queries, approximations, and the Boolean hierarchy (Q1854449) (← links)
- Cognitive hierarchy and voting manipulation in \(k\)-approval voting (Q2019338) (← links)
- The robustness of LWPP and WPP, with an application to graph reconstruction (Q2027204) (← links)
- A complexity theory for feasible closure properties (Q2366687) (← links)
- All superlinear inverse schemes are coNP-hard (Q2575753) (← links)
- Function operators spanning the arithmetical and the polynomial hierarchy (Q3060205) (← links)
- Simultaneous strong separations of probabilistic and unambiguous complexity classes (Q3992020) (← links)
- A Downward Collapse within the Polynomial Hierarchy (Q4210153) (← links)
- Query Order (Q4210168) (← links)
- Strong self-reducibility precludes strong immunity (Q4895818) (← links)
- (Q5005153) (← links)
- A downward translation in the polynomial hierarchy (Q5048934) (← links)
- On the power of parity polynomial time (Q5096157) (← links)
- Reductions to sets of low information content (Q5204315) (← links)
- On the power of parity polynomial time (Q5750401) (← links)
- Intersection suffices for Boolean hierarchy equivalence (Q6085737) (← links)