STACS 2004

DOI10.1007/B96012MaRDI QIDQ5309686zbMATH OpenOpenAlexFDO

Authors Kristoffer Arnsfelt Hansen

Publication date 1 October 2007

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

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

Mathematics Subject Classification ID

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

Recommendations

• Constant width planar computation characterizes ACC\(^{0}\)
• A new characterization of \(\text{ACC}^{0}\) and probabilistic \(\text{CC}^{0}\)
• Circuits on cylinders.
• Circuits on cylinders
• Circuit complexity of properties of graphs with constant planar cutwidth

Cited in

(4)

• A new characterization of \(\text{ACC}^{0}\) and probabilistic \(\text{CC}^{0}\)
• Circuits on cylinders
• Circuits on cylinders.
• Constant width planar computation characterizes ACC\(^{0}\)

This page was built for publication: STACS 2004

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