Gap Amplification in PCPs Using Lazy Random Walks

DOI10.1007/11786986_10zbMath1223.68049OpenAlexW1530525467MaRDI QIDQ3613752

No author found.

Publication date: 12 March 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11786986_10

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

This page was built for publication: Gap Amplification in PCPs Using Lazy Random Walks