Towards NEXP versus BPP?

DOI10.1007/978-3-642-38536-0_15zbMath1381.68092OpenAlexW66772381MaRDI QIDQ4928482

R. Ryan Williams

Publication date: 14 June 2013

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38536-0_15

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity

This page was built for publication: Towards NEXP versus BPP?