Pages that link to "Item:Q626681"
From MaRDI portal
The following pages link to Sub-constant error probabilistically checkable proof of almost-linear size (Q626681):
Displayed 5 items.
- Tight bounds on subexponential time approximation of set cover and related problems (Q2117696) (← links)
- Three-Player Entangled XOR Games are NP-Hard to Approximate (Q2816299) (← links)
- Composition of Low-Error 2-Query PCPs Using Decodable PCPs (Q4933379) (← links)
- ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network (Q4993301) (← links)
- Mathematics of computation through the lens of linear equations and lattices (Q6198651) (← links)