The following pages link to IP = SPACE (Q4302794):
Displaying 14 items.
- Shorter arithmetization of nondeterministic computations (Q496013) (← links)
- Geometric sets of low information content (Q1351460) (← links)
- Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity (Q1604200) (← links)
- PSPACE has constant-round quantum interactive proof systems (Q1870552) (← links)
- Probabilistic verification of proofs in calculuses (Q1977920) (← links)
- IP = PSPACE using error-correcting codes (Q2839183) (← links)
- \(\mathrm{QIP} = \mathrm{PSPACE}\) (Q2875184) (← links)
- Algebraic methods for interactive proof systems (Q4302792) (← links)
- Generalized Quantum Arthur--Merlin Games (Q4634057) (← links)
- Nonlocal Games with Noisy Maximally Entangled States are Decidable (Q5096445) (← links)
- (Q5111868) (← links)
- A combination of testability and decodability by tensor products (Q5252263) (← links)
- QIP = PSPACE (Q5395673) (← links)
- Logspace verifiers, NC, and NP (Q6487945) (← links)
