Pages that link to "Item:Q3430210"
From MaRDI portal
The following pages link to On Dinur’s proof of the PCP theorem (Q3430210):
Displaying 5 items.
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Expander graphs -- both local and global (Q2226628) (← links)
- Function simulation, graph grammars and colourings (Q2855758) (← links)
- Revisiting alphabet reduction in Dinur’s PCP. (Q6062158) (← links)
- Hyper-regular graphs and high dimensional expanders (Q6076191) (← links)