Pages that link to "Item:Q1318475"
From MaRDI portal
The following pages link to PSPACE is provable by two provers in one round (Q1318475):
Displaying 8 items.
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
- The relativized relationship between probabilistically checkable debate systems, IP and PSPACE (Q673812) (← links)
- On games of incomplete information (Q1199525) (← links)
- Towards the parallel repetition conjecture (Q1351513) (← links)
- Fully parallelized multi-prover protocols for NEXP-time (Q1356878) (← links)
- Quantum multi-prover interactive proof systems with limited prior entanglement. (Q1401955) (← links)
- PSPACE has constant-round quantum interactive proof systems (Q1870552) (← links)
- Parallelization of entanglement-resistant multi-prover interactive proofs (Q2015158) (← links)