Pages that link to "Item:Q1356878"
From MaRDI portal
The following pages link to Fully parallelized multi-prover protocols for NEXP-time (Q1356878):
Displaying 9 items.
- On games of incomplete information (Q1199525) (← links)
- PSPACE is provable by two provers in one round (Q1318475) (← links)
- On the power of multi-prover interactive protocols (Q1341733) (← links)
- Quantum multi-prover interactive proof systems with limited prior entanglement. (Q1401955) (← links)
- The complexity of approximating a nonlinear program (Q1906280) (← links)
- Short Locally Testable Codes and Proofs (Q3088191) (← links)
- The approximation of maximum subgraph problems (Q4630247) (← links)
- Short Locally Testable Codes and Proofs: A Survey in Two Parts (Q4933364) (← links)
- Parallel Repetition of Two-Prover One-Round Games: An Exposition (Q5135260) (← links)