Pages that link to "Item:Q2817609"
From MaRDI portal
The following pages link to Two prover protocols, low error at affordable rates (Q2817609):
Displaying 9 items.
- Zero knowledge and the chromatic number (Q1276168) (← links)
- Interactive and probabilistic proof-checking (Q1577488) (← links)
- Multi-prover encoding schemes and three-prover proof systems (Q1816732) (← links)
- On weighted vs unweighted versions of combinatorial optimization problems (Q1854428) (← links)
- A one-round, two-prover, zero-knowledge protocol for NP (Q1894702) (← links)
- Improved non-approximability results for minimum vertex cover with density constraints (Q1960657) (← links)
- A two-prover one-round game with strong soundness (Q3191598) (← links)
- Impossibility results for recycling random bits in two-prover proof systems (Q4234094) (← links)
- Two-Prover Protocols---Low Error at Affordable Rates (Q4507353) (← links)