Pages that link to "Item:Q1606968"
From MaRDI portal
The following pages link to \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\) (Q1606968):
Displaying 16 items.
- Quantum weakly nondeterministic communication complexity (Q387026) (← links)
- A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs (Q443724) (← links)
- Approximate counting for complex-weighted Boolean constraint satisfaction problems (Q690490) (← links)
- Quantum zero-error algorithms cannot be composed (Q1014398) (← links)
- Theory of one-tape linear-time Turing machines (Q1041220) (← links)
- More on quantum, stochastic, and pseudo stochastic languages with few states (Q2003453) (← links)
- A structured view on weighted counting with relations to counting, quantum computation and applications (Q2216125) (← links)
- Quantum alternation (Q2361668) (← links)
- Polynomial time quantum computation with advice (Q2390250) (← links)
- Quantum and classical complexity classes: Separations, collapses, and closure properties (Q2486397) (← links)
- \(\mathrm{QIP} = \mathrm{PSPACE}\) (Q2875184) (← links)
- Complexity Bounds of Constant-Space Quantum Computation (Q3451121) (← links)
- Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy (Q4946417) (← links)
- QIP = PSPACE (Q5395673) (← links)
- ANALYSIS OF QUANTUM FUNCTIONS (Q5696940) (← links)
- QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES (Q5696941) (← links)