Pages that link to "Item:Q4507353"

The following pages link to Two-Prover Protocols---Low Error at Affordable Rates (Q4507353):

Displaying 4 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)