Pages that link to "Item:Q4507353"
From MaRDI portal
The following pages link to Two-Prover Protocols---Low Error at Affordable Rates (Q4507353):
Displaying 6 items.
- Clique is hard to approximate within \(n^{1-\epsilon}\) (Q1588908) (← links)
- The complexity of approximating a nonlinear program (Q1906280) (← links)
- A parallel repetition theorem for entangled projection games (Q2351389) (← links)
- (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)
