Hardness and hierarchy theorems for probabilistic quasi-polynomial time

DOI10.1145/301250.301444zbMath1346.68095OpenAlexW2095531897MaRDI QIDQ2819602

No author found.

Publication date: 29 September 2016

Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/301250.301444

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 (2)

Paradigms for Unconditional Pseudorandom Generators ⋮ Randomness vs time: Derandomization under a uniform assumption

This page was built for publication: Hardness and hierarchy theorems for probabilistic quasi-polynomial time