Pages that link to "Item:Q649097"
From MaRDI portal
The following pages link to PCP characterizations of NP: toward a polynomially-small error-probability (Q649097):
Displaying 11 items.
- Approximation and hardness results for label cut and related problems (Q630189) (← links)
- Derandomized parallel repetition via structured PCPs (Q645129) (← links)
- PCP characterizations of NP: toward a polynomially-small error-probability (Q649097) (← links)
- Quantum information and the PCP theorem (Q835644) (← links)
- PCPs via the low-degree long code and hardness for constrained hypergraph coloring (Q891178) (← links)
- Smooth and strong PCPs (Q2029773) (← links)
- Low-degree test with polynomially small error (Q2410685) (← links)
- On the hardness of approximating the min-hack problem (Q2569170) (← links)
- Three-Player Entangled XOR Games are NP-Hard to Approximate (Q2816299) (← 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)
