Advertisement

Arithmetic Constant-Depth Circuit Complexity Classes

  • Hubie Chen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2747)

Abstract

The boolean circuit complexity classes AC 0 ⊆ AC 0[m] ⊆ TC 0 ⊆ NC 1 have been studied intensely. Other than NC 1, they are defined by constant-depth circuits of polynomial size and unbounded fan-in over some set of allowed gates. One reason for interest in these classes is that they contain the boundary marking the limits of current lower bound technology: such technology exists for AC 0 and some of the classes AC 0[m], while the other classes AC 0[m] as well as TC 0 lack such technology.

Continuing a line of research originating from Valiant’s work on the counting class \(\ensuremath{\sharp} P\), the arithmetic circuit complexity classes \(\ensuremath{\sharp} AC^0\) and \(\ensuremath{\sharp} NC^1\) have recently been studied. In this paper, we define and investigate the classes \(\ensuremath{\sharp} AC^0[m]\) and \(\ensuremath{\sharp} TC^0\), new arithmetic circuit complexity classes that are defined by constant-depth circuits and are analogues of the classes AC 0[m] and TC 0.

Keywords

Boolean Function Closure Property Circuit Complexity Language Class Arithmetic Circuit 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agrawal, M., Allender, E., Datta, S.: On TC0, AC0, and arithmetic circuits. In: Proceedings 12th Computational Complexity, pp. 134–148. IEEE Computer Society Press, Los Alamitos (1997)Google Scholar
  2. 2.
    Allender, E.: Making computation count: arithmetic circuits in the nineties. SIGACT News 28(4), 2–15 (1998)CrossRefGoogle Scholar
  3. 3.
    Allender, E., Ambainis, A., Mix Barrington, D.A., Datta, S., LêThanh, H.: Bounded depth arithmetic circuits: Counting and closure. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 149–158. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  4. 4.
    Allender, E., Jiao, J., Mahajan, M., Vinay, V.: Non-commutative arithmetic circuits: depth reduction and size lower bounds. Theoretical Computer Science 209, 47–86 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Allender, E., Ogihara, M.: Relationships among PL, #L, and the determinant. RAIRO – Theoretical Informatics and Applications 30, 1–21 (1996)zbMATHMathSciNetGoogle Scholar
  6. 6.
    Àlvarez, C., Jenner, B.: A very hard log space counting class. Theoretical Computer Science 107, 3–30 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Ambainis, A., Mix Barrington, D.A., LêThanh, H.: On counting AC0 circuits with negative constants. In: Proceedings 23rd Mathematical Foundations of Computer Science. LNCS, vol. 1450, pp. 409–417. Springer, Berlin (1998)Google Scholar
  8. 8.
    Caussinus, H., McKenzie, P., Thérien, D., Vollmer, H.: Nondeterministic NC1 computation. Journal of Computer and System Sciences 57, 200–212 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Smolensky, R.: Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In: Proceedings 19th Symposium on Theory of Computing, pp. 77–82. ACM Press, New York (1987)Google Scholar
  10. 10.
    Toda, S.: Classes of arithmetic circuits capturing the complexity of computing the determinant. IEICE Transactions on Communications/Electronics/Information and Systems E75-D, 116–124 (1992)Google Scholar
  11. 11.
    Valiant, L.G.: The complexity of computing the permanent. Theoretical Computer Science 8, 189–201 (1979)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Venkateswaran, H.: Circuit definitions of non-deterministic complexity classes. SIAM Journal on Computing 21, 655–670 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Vinay, V.: Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits. In: Proceedings 6th Structure in Complexity Theory, pp. 270–284. IEEE Computer Society Press, Los Alamitos (1991)CrossRefGoogle Scholar
  14. 14.
    Vollmer, H.: Introduction to Circuit Complexity. Springer, Heidelberg (1999)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Hubie Chen
    • 1
  1. 1.Department of Computer ScienceCornell UniversityIthacaUSA

Personalised recommendations