Pages that link to "Item:Q4507353"
From MaRDI portal
The following pages link to Two-Prover Protocols---Low Error at Affordable Rates (Q4507353):
Displaying 12 items.
- A note on PCP vs. MIP (Q1350618) (← links)
- Error reduction by parallel repetition - a negative result (Q1397480) (← links)
- Clique is hard to approximate within \(n^{1-\epsilon}\) (Q1588908) (← links)
- The complexity of approximating a nonlinear program (Q1906280) (← links)
- Two-party ECDSA from hash proof systems and efficient instantiations (Q2304919) (← links)
- A parallel repetition theorem for entangled projection games (Q2351389) (← links)
- Two prover protocols, low error at affordable rates (Q2817609) (← 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)
- Parallel repetition via fortification: analytic view and the quantum case (Q4638072) (← links)
- Anchored Parallel Repetition for Nonlocal Games (Q5067446) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)