\(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\)
From MaRDI portal
Publication:1606968
DOI10.1016/S0020-0190(99)00084-8zbMath0999.68074OpenAlexW1555499558MaRDI QIDQ1606968
Tomoyuki Yamakami, Andrew Chi-Chih Yao
Publication date: 25 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00084-8
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (13)
Quantum alternation ⋮ Complexity Bounds of Constant-Space Quantum Computation ⋮ Polynomial time quantum computation with advice ⋮ Quantum weakly nondeterministic communication complexity ⋮ A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs ⋮ A structured view on weighted counting with relations to counting, quantum computation and applications ⋮ ANALYSIS OF QUANTUM FUNCTIONS ⋮ QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES ⋮ Approximate counting for complex-weighted Boolean constraint satisfaction problems ⋮ More on quantum, stochastic, and pseudo stochastic languages with few states ⋮ Quantum and classical complexity classes: Separations, collapses, and closure properties ⋮ Quantum zero-error algorithms cannot be composed ⋮ Theory of one-tape linear-time Turing machines
This page was built for publication: \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\)
