Pages that link to "Item:Q4210153"
From MaRDI portal
The following pages link to A Downward Collapse within the Polynomial Hierarchy (Q4210153):
Displaying 10 items.
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- The 1-versus-2 queries problem revisited (Q970102) (← links)
- Tally NP sets and easy census functions. (Q1854340) (← links)
- Commutative queries (Q1854422) (← links)
- Bounded queries, approximations, and the Boolean hierarchy (Q1854449) (← links)
- Two queries (Q1961371) (← links)
- Query Order (Q4210168) (← links)
- Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies (Q4800264) (← links)
- The 1-Versus-2 Queries Problem Revisited (Q5387752) (← links)
- Weak cardinality theorems (Q5718691) (← links)
