Abstract
Constant-depth arithmetic circuits have been defined and studied in [AAD97,ABL98]; these circuits yield the function classes #AC0 and GapAC0. These function classes in turn provide new characterizati- ons of the computational power of threshold circuits, and provide a link between the circuit classes AC0 (where many lower bounds are known) and TC0 (where essentially no lower bounds are known). In this paper, we resolve several questions regarding the closure properties of #AC0 and GapAC0 and characterize #AC0 in terms of counting paths in a family of bounded-width graphs. © Springer-Verlag Berlin Heidelberg 1999.
Cite
CITATION STYLE
Allender, E., Ambainis, A., Barrington, D. A. M., Datta, S., & Lêthanh, H. (1999). Bounded depth arithmetic circuits: Counting and closure. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1644 LNCS, pp. 149–158). Springer Verlag. https://doi.org/10.1007/3-540-48523-6_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
