Advertisement

Dual VP Classes

  • Eric Allender
  • Anna Gál
  • Ian Mertz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9235)

Abstract

We consider the complexity class \({\mathsf{ACC}}^1\) and related families of arithmetic circuits. We prove a variety of collapse results, showing several settings in which no loss of computational power results if fan-in of gates is severely restricted, as well as presenting a natural class of arithmetic circuits in which no expressive power is lost by severely restricting the algebraic degree of the circuits. These results tend to support a conjecture regarding the computational power of the complexity class VP over finite algebras, and they also highlight the significance of a class of arithmetic circuits that is in some sense dual to VP.

Keywords

Complexity Class Prime Power Multiplication Gate Arithmetic Circuit Algebraic Degree 
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.

Notes

Acknowledgments

The first and third authors acknowledge the support of NSF grants CCF-0832787 and CCF-1064785. The second author was supported in part by NSF grant CCF-1018060. We also acknowledge stimulating conversations with Meena Mahajan, which occurred at the 2014 Dagstuhl Workshop on the Complexity of Discrete Problems (Dagstuhl Seminar 14121), and illuminating conversations with Stephen Fenner and Michal Koucký, which occurred at the 2014 Dagstuhl Workshop on Algebra in Computational Complexity (Dagstuhl Seminar 14391). We also thank Igor Shparlinski and our Rutgers colleagues Richard Bumby, John Miller and Steve Miller, for helpful pointers to the literature, as well as helpful feedback from Pascal Koiran and Russell Impagliazzo.

References

  1. 1.
    Agrawal, M., Allender, E., Datta, S.: On TC\(^0\), AC\(^0\), and arithmetic circuits. J. Comput. Syst. Sci. 60, 395–421 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Allender, J., Jiao, J., Mahajan, M., Vinay, V.: Non-commutative arithmetic circuits. Theoret. Comp. Sci. 209, 47–86 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Allender, E., Gál, A., Mertz, I.: Dual VP classes. In: ECCC (2014). TR14-122Google Scholar
  4. 4.
    Allender, E., Reinhardt, K., Zhou, S.: Isolation, matching, and counting: Uniform and nonuniform upper bounds. J. Comput. Syst. Sci. 59(2), 164–181 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer, Heidelberg (1998)CrossRefzbMATHGoogle Scholar
  6. 6.
    Borodin, A., Cook, S.A., Dymond, P.W., Ruzzo, W.L., Tompa, M.: Two applications of inductive counting for complementation problems. SIAM J. Comput. 18, 559–578 (1989). See Erratum in SIAM. J. Comput. 18, 1283 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Buhrman, H., Cleve, R., Koucký, M., Loff, B., Speelman, F.: Computing with a full memory: catalytic space. In: STOC, pp. 857–866 (2014)Google Scholar
  8. 8.
    Corrales-Rodrigáñez, C., Schoof, R.: The support problem and its elliptic analogue. J. Num. Theor. 64(2), 276–290 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Gál, A., Wigderson, A.: Boolean complexity classes vs. their arithmetic analogs. Random Struct. Algorithms 9(1–2), 99–111 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Hansen, K.A., Koucký, M.: A new characterization of ACC\(^0\) and probabilistic CC\(^0\). Comput. Complex. 19(2), 211–234 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Immerman, N., Landau, S.: The complexity of iterated multiplication. Inf. Comput. 116, 103–116 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Reif, J., Tate, S.: On threshold circuits and polynomial computation. SIAM J. Comput. 21, 896–908 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Reinhardt, K., Allender, E.: Making nondeterminism unambiguous. SIAM J. Comput. 29, 1118–1131 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Smolensky, R.: Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In: STOC, pp. 77–82 (1987)Google Scholar
  15. 15.
    Valiant, L.G.: Completeness classes in algebra. In: Proceedings of the 11th ACM STOC, pp. 249–261 (1979)Google Scholar
  16. 16.
    Valiant, L.G., Skyum, S., Berkowitz, S., Rackoff, C.: Fast parallel computation of polynomials using few processors. SIAM J. Comput. 12(4), 641–644 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Vinay, V.: Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits. In: Proceedings of 6th Structure in Complexity Theory Conference, pp. 270–284 (1991)Google Scholar
  18. 18.
    Vollmer, H.: Introduction to Circuit Complexity: A Uniform Approach. Springer, Heidelberg (1999)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  1. 1.Department of Computer ScienceRutgers UniversityPiscatawayUSA
  2. 2.Department of Computer ScienceUniversity of TexasAustinUSA

Personalised recommendations