Pages that link to "Item:Q5289273"
From MaRDI portal
The following pages link to A relationship between difference hierarchies and relativized polynomial hierarchies (Q5289273):
Displaying 20 items.
- The 1-versus-2 queries problem revisited (Q970102) (← links)
- Exact complexity of exact-four-colorability (Q1014384) (← links)
- Commutative queries (Q1854422) (← links)
- Bounded queries, approximations, and the Boolean hierarchy (Q1854449) (← links)
- Two queries (Q1961371) (← links)
- Proving SAT does not have small circuits with an application to the two queries problem (Q2475408) (← links)
- A note on parallel queries and the symmetric-difference hierarchy. (Q2583533) (← links)
- On the power of deterministic reductions to C=P (Q4032933) (← links)
- A Downward Collapse within the Polynomial Hierarchy (Q4210153) (← links)
- Query Order (Q4210168) (← 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)
- Restrictive Acceptance Suffices for Equivalence Problems (Q4504964) (← links)
- Bounded queries to arbitrary sets (Q4717045) (← links)
- A downward translation in the polynomial hierarchy (Q5048934) (← links)
- Query order in the polynomial hierarchy (Q5055937) (← links)
- When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems (Q5067445) (← links)
- The 1-Versus-2 Queries Problem Revisited (Q5387752) (← links)
- On boolean lowness and boolean highness (Q5941441) (← links)
- Intersection suffices for Boolean hierarchy equivalence (Q6085737) (← links)
