Mathematical Foundations of Computer Science 2004

DOI10.1007/B99679MaRDI QIDQ5311110zbMATH OpenOpenAlexFDO

Authors Alina Beygelzimer, Ogihara, Mitsunori

Publication date 22 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• The enumerability of P collapses P to NC
• scientific article; zbMATH DE number 1559536
• P-uniform circuit complexity
• Elimination of parameters in the polynomial hierarchy
• Enumerative counting is hard

Cited in

(2)

• The enumerability of P collapses P to NC
• Collapsing exact arithmetic hierarchies

This page was built for publication: Mathematical Foundations of Computer Science 2004

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