A # P-complete problem over arithmetical trees

  • Giancarlo Mauri
  • Nicoletta Sabadini
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 112)


Turing Machine Enumeration Problem Complete Problem Univariate Polynomial Multivariate Polynomial 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Aho, A.V., Ullman, J.E., Hopcroft, J.D., The Design and Analysis of Computer Algorithms, Addison Wesley, Reading, Mass., 1974Google Scholar
  2. [2]
    Bertoni,A., Mauri,G., Sabadini,N., A characterization of the class of functions computable in polynomial time on RAM's, Proc. ACM STOC 81, to appear, 1981Google Scholar
  3. [3]
    Garey, M.R., Johnson, D.S., Computers and Intractability, W.H. Freeman and Co., San Francisco, 1979Google Scholar
  4. [4]
    Hartmanis,J., Simon,J., On the power of multiplication in Random Access Machines, IEEE Conf. Rec. 15th Symp. on Switching Automata Theory, 1974, 13–23Google Scholar
  5. [5]
    Percus, J.K., Combinatorial Methods, Springer, Berlin, 1971Google Scholar
  6. [6]
    Riordan, J., An introduction to combinatorial analysis, Wiley, New York, 1958Google Scholar
  7. [7]
    Schönhage, A., On the power of Random Access Machines, Proc. 6th ICALP, Lect. Not. in Comp. Sci. 71, Springer, Berlin, 1979, 520–529Google Scholar
  8. [8]
    Simon, J., On the difference between the one and the many, in Lect. Not. in Comp. Sci. 52, Springer, Berlin, 1977, 480–491Google Scholar
  9. [9]
    Simon,J., Division is good, Comp. Sci. Dept., Pennsylvania State University, 1979Google Scholar
  10. [10]
    Valiant, L.G., The complexity of computing the permanent, Theoretical Computer Science 8, 1979, 189–202Google Scholar
  11. [11]
    Valiant,L.G., The complexity of enumeration and reliability problems, Res. Rep. CSR-15 77, Dept. of Comp. Sci., Univ. of Edinburgh, 1977Google Scholar
  12. [12]
    Valiant,L.G., Completeness classes in algebra, 11th ACM STOC, 1979, 249–261Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Giancarlo Mauri
    • 2
    • 1
  • Nicoletta Sabadini
    • 1
  1. 1.Istituto di CiberneticaUniversità di MilanoItaly
  2. 2.Istituto di Matematica, Informatica e SistemisticaUniversità di UdineItaly

Personalised recommendations