scientific article; zbMATH DE number 1335894
From MaRDI portal
Publication:4258585
Recommendations
Cited in
(17)- Theory of one-tape linear-time Turing machines
- New quantum algorithm for studying NP-complete problems
- Complexity limitations on quantum computation
- Quantum and classical complexity classes: Separations, collapses, and closure properties
- Graph Isomorphism is in SPP
- scientific article; zbMATH DE number 1583884 (Why is no real title available?)
- BQP and the polynomial hierarchy
- Quantum circuits and low-degree polynomials over \(\mathbb{F}_2\)
- The Limits of Quantum Computers
- Quantum Complexity Theory
- scientific article; zbMATH DE number 1796836 (Why is no real title available?)
- Power of quantum computation with few clean qubits
- scientific article; zbMATH DE number 2086395 (Why is no real title available?)
- Computation in generalised probabilisitic theories
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Unconventional Computation
- Computation in a general physical setting
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 Q4258585)
