scientific article; zbMATH DE number 559220
From MaRDI portal
Publication:4289278
Cited in
(25)- Time-space tradeoffs for satisfiability
- Relativized worlds with an infinite hierarchy
- On the limits of gate elimination
- One complexity theorist's view of quantum computing
- The robustness of LWPP and WPP, with an application to graph reconstruction
- Can we resolve the continuum hypothesis?
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\)
- On complete problems, relativizations and logics for complexity classes
- Relativization of complexity and sensitivity
- Limits of Constructive Security Proofs
- scientific article; zbMATH DE number 4080913 (Why is no real title available?)
- scientific article; zbMATH DE number 8778 (Why is no real title available?)
- scientific article; zbMATH DE number 58312 (Why is no real title available?)
- Strong self-reducibility precludes strong immunity
- Universality, invariance, and the foundations of computational complexity in the light of the quantum computer
- Affine relativization: unifying the algebrization and relativization barriers
- Quantum generalizations of the polynomial hierarchy with applications to QMA(2)
- The size of SPP
- Observations on complete sets between linear time and polynomial time
- Complexity barriers as independence
- Guidable local Hamiltonian problems with implications to heuristic ansatz state preparation and the quantum PCP conjecture
- Relativized succinct arguments in the ROM do not exist
- Computing equilibria: a computational complexity perspective
- Structural properties of oracle classes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4289278)
