Hierarchy theorems for probabilistic polynomial time

DOI10.1109/FOCS.2004.33MaRDI QIDQ7255262zbMATH OpenFDO

Authors Lance Fortnow, Rahul Santhanam

Publication date 29 May 2026

Full work available at URL https://doi.org/10.1109/FOCS.2004.33

Mathematics Subject Classification ID

Computer science (68-XX)

Cited in

(1)

• Oblivious complexity classes revisited: lower bounds and hierarchies

This page was built for publication: Hierarchy theorems for probabilistic polynomial time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7255262)