Publication Date
1999
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 characterizations 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.
Recommended Citation
Allender, Eric, "Bounded Depth Arithmetic Circuits: Counting and Closure" (1999). Computer Science Department Faculty Publication Series. 88.
Retrieved from https://scholarworks.umass.edu/cs_faculty_pubs/88
Comments
This paper was harvested from CiteSeer