scientific article; zbMATH DE number 559220
From MaRDI portal
Publication:4289278
zbMath0791.68062MaRDI QIDQ4289278
Publication date: 24 May 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (19)
On the limits of gate elimination ⋮ Computing equilibria: a computational complexity perspective ⋮ The size of SPP ⋮ Observations on complete sets between linear time and polynomial time ⋮ Unnamed Item ⋮ Strong self-reducibility precludes strong immunity ⋮ On Complete Problems, Relativizations and Logics for Complexity Classes ⋮ Limits of Constructive Security Proofs ⋮ The robustness of LWPP and WPP, with an application to graph reconstruction ⋮ Structural properties of oracle classes ⋮ Complexity barriers as independence ⋮ Unnamed Item ⋮ Can we resolve the continuum hypothesis? ⋮ Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer ⋮ \textsc{Fractal}: post-quantum and transparent recursive proofs from holography ⋮ Time-space tradeoffs for satisfiability ⋮ Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\) ⋮ Relativized worlds with an infinite hierarchy ⋮ One complexity theorist's view of quantum computing
This page was built for publication:
