Collapsing exact arithmetic hierarchies

DOI10.1007/978-3-319-04657-0_26MaRDI QIDQ5746264zbMATH OpenOpenAlexFDO

Authors Nikhil Balaji, Samir Datta

Publication date 18 February 2014

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-04657-0_26

Mathematics Subject Classification ID

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

Recommendations

• Counting classes and the fine structure between \(\mathrm{NC}^1\) and \(L\)
• Counting classes and the fine structure between {\textsf{NC}}\(^{1}\) and {\textsf{L}}
• scientific article; zbMATH DE number 4080916
• The strong exponential hierarchy collapses
• Mathematical Foundations of Computer Science 2004

Cited in

(3)

• scientific article; zbMATH DE number 176750 (Why is no real title available?)
• Computing Solutions Uniquely Collapses the Polynomial Hierarchy
• Partial collapses of the \(\Sigma _1\) complexity hierarchy in models for fragments of bounded arithmetic

This page was built for publication: Collapsing exact arithmetic hierarchies

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