The following pages link to An oracle builder's toolkit (Q1398366):
Displaying 22 items.
- Complexity classes of equivalence problems revisited (Q716333) (← links)
- AM\(_{\text{exp}}\nsubseteq (\text{NP} \cap \text{coNP})\)/poly (Q1029043) (← links)
- A hierarchy based on output multiplicity (Q1274991) (← links)
- A general method to construct oracles realizing given relationships between complexity classes (Q1351504) (← links)
- The isomorphism conjecture holds and one-way functions exist relative to an oracle (Q1362333) (← links)
- A tight relationship between generic oracles and type-2 complexity theory (Q1369098) (← links)
- An oracle builder's toolkit (Q1398366) (← links)
- Relativized worlds with an infinite hierarchy (Q1606916) (← links)
- Complexity measures and decision tree complexity: a survey. (Q1853508) (← links)
- One complexity theorist's view of quantum computing (Q1870556) (← links)
- Complexity limitations on quantum computation (Q1961375) (← 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)
- Partially definable forcing and bounded arithmetic (Q2257103) (← links)
- Quantum and classical complexity classes: Separations, collapses, and closure properties (Q2486397) (← links)
- LWPP and WPP are not uniformly gap-definable (Q2495405) (← links)
- Graph Isomorphism is in SPP (Q2495656) (← links)
- Error-bounded probabilistic computations between MA and AM (Q2507698) (← links)
- Typical forcings, NP search problems and an extension of a theorem of Riis (Q2659102) (← links)
- Strong self-reducibility precludes strong immunity (Q4895818) (← links)
- (Q5005160) (← links)
- NEW RELATIONS AND SEPARATIONS OF CONJECTURES ABOUT INCOMPLETENESS IN THE FINITE DOMAIN (Q5100043) (← links)
