Publication:4636476

DOI10.4230/LIPIcs.APPROX-RANDOM.2016.42zbMath1398.68185arXiv1607.07130MaRDI QIDQ4636476

Govind Ramnarayan, Henry C. Yuen, Dana Moshkovitz

Publication date: 19 April 2018

Full work available at URL: https://arxiv.org/abs/1607.07130

zbMATH Keywords

derandomization; fortification; parallel repetition; Feige-Kilian

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

Related Items

Low-degree test with polynomially small error