NQP_C=co-C_=P
From MaRDI portal
Publication:1606968
Recommendations
- \(\mathrm P \overset {?} {=} \mathrm{NP}\)
- QL(ℂn) determines n
- \(\mathrm{QIP} = \mathrm{PSPACE}\)
- QIP = PSPACE
- (1, 1)-\(q\)-coherent pairs
- On an optimal quantified propositional proof system nal proof system and a complete language for NP ∩ co-NP for NP ∩ co-NP
- scientific article; zbMATH DE number 3950504
- D.C. versus copositive bounds for standard QP
- scientific article; zbMATH DE number 6287555
- A non-unital \(^\ast\)-algebra has U\(C^\ast\)NP if and only if its unitization has U\(C^\ast\)NP
Cited in
(17)- Exact non-identity check is NQP-complete
- \(\mathrm{QIP} = \mathrm{PSPACE}\)
- On interpolating between quantum and classical complexity classes
- Quantum zero-error algorithms cannot be composed
- More on quantum, stochastic, and pseudo stochastic languages with few states
- Quantum and classical complexity classes: Separations, collapses, and closure properties
- Polynomial time quantum computation with advice
- 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
- Quantum weakly nondeterministic communication complexity
- Complexity bounds of constant-space quantum computation
- Quantum alternation
- Theory of one-tape linear-time Turing machines
- Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy
- ANALYSIS OF QUANTUM FUNCTIONS
- QIP = PSPACE
- QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES
This page was built for publication: \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1606968)
