The following pages link to QIP = PSPACE (Q5395673):
Displaying 14 items.
- Parallel approximation of min-max problems (Q354658) (← links)
- \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\) (Q1606968) (← links)
- PSPACE has constant-round quantum interactive proof systems (Q1870552) (← links)
- Constant-space quantum interactive proofs against multiple provers (Q2252642) (← links)
- QPCF: higher-order languages and quantum circuits (Q2331073) (← links)
- Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence (Q2414908) (← links)
- Quantum interactive proofs with weak error bounds (Q2826062) (← links)
- \(\mathrm{QIP} = \mathrm{PSPACE}\) (Q2875184) (← links)
- Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete (Q2954372) (← links)
- IP = SPACE (Q4302794) (← links)
- Generalized Quantum Arthur--Merlin Games (Q4634057) (← links)
- Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method (Q4993286) (← links)
- (Q5091176) (← links)
- (Q5874542) (← links)
