Abstract
We extend the familiar program of understanding circuit complexity in terms of regular languages to visibly counter languages. Like the regular languages, the visibly counter languages are NC1- complete. We investigate what the visibly counter languages in certain constant depth circuit complexity classes are. We have initiated this in a previous work for AC0. We present characterizations and decidability results for various logics and circuit classes. In particular, our approach yields a way to understand TC0, where the regular approach fails.
Cite
CITATION STYLE
Hahn, M., Krebs, A., Lange, K. J., & Ludwig, M. (2015). Visibly counter languages and the structure of NC1. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9235, pp. 384–394). Springer Verlag. https://doi.org/10.1007/978-3-662-48054-0_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
