On counting and approximation

  • Johannes Köbler
  • Uwe Schöning
  • Jacobo Toran
Part of the Lecture Notes in Computer Science book series (LNCS, volume 299)


We introduce a new class of functions, called span functions which count the different output values that occur at the leaves of the computation tree associated with a nondeterministic polynomial time Turing machine transducer. This function class has natural complete problems; it is placed between Valiant's function classes #P and #NP, and contains both Goldberg and Sipser's ranking functions for sets in NP, and Krentel's optimization functions. We show that it is unlikely that the span functions coincide with any of the mentioned function classes.

A probabilistic approximation method (using an oracle in NP) is presented to approximate span functions up to any desired degree of accuracy. This approximation method is based on universal hashing and it never underestimates the correct value of the approximated function.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    E.W.Allender, Invertible functions, Ph.D. Thesis, Georgia Institute of Technology, 1985.Google Scholar
  2. [2]
    L. Babai, Trading group theory for randomness, Proc. 17th STOC, 1985, 421–429.Google Scholar
  3. [3]
    R.B. Boppana, J. Hastad and S. Zachos, Does co-NP have short interactive proofs?, Information Processing Letters 25, 1987, 127–132.Google Scholar
  4. [4]
    A.V. Goldberg and M.Sipser, Compresion and ranking, Proc. 17th STOC, 1985, 440–448.Google Scholar
  5. [5]
    S. Goldwasser and M. Sipser, Private coins versus public coins in interactive proof systems, Proc. 18th STOC, 1986, 59–68.Google Scholar
  6. [6]
    S. Grollmann and A.L. Selman, Complexity measures for publik-key crypto-systems, Proc. 25th FOCS 1984, 495–503.Google Scholar
  7. [7]
    L. Hemachandra, On ranking, Proc. 2nd Structure in Complexity Theory Conf., 1987, 103–117.Google Scholar
  8. [8]
    M.W. Krentel, The complexity of optimization problems, Proc. 18th STOC 1986, 69–76.Google Scholar
  9. [9]
    M.R. Jerrum, L.G. Valiant and V.V. Vazirani, Random generation of combinatorial structures from a uniform distribution, Theor. Comput. Sci. 43 (1986), 169–188Google Scholar
  10. [10]
    U. Schöning, Graph isomorphism is in the low hierarchy, Proc. 4th STACS 1987, Lecture Notes in Comput. Science, 114–124.Google Scholar
  11. [11]
    M. Sipser, A complexity theoretic approach to randomness, Proc. 15th STOC, 1983, 330–335.Google Scholar
  12. [12]
    L. Stockmeyer, The polynomial time hierarchy, Theoret. Comput. Science 3 (1977), 1–22.Google Scholar
  13. [13]
    L. Stockmeyer, On approximation algorithms for #P, SIAM Journ. on Comput. 14 (1985), 849–861.Google Scholar
  14. [14]
    L.G. Valiant, Relative complexity of checking and evaluating, Inform. Proc. Letters 5 (1976), 20–23.Google Scholar
  15. [15]
    L.G. Valiant, The complexity of computing the permanent, Theor. Comput. Sci. 8 (1979), 189–201.Google Scholar
  16. [16]
    L.G. Valiant, The complexity of enumeration and reliability problems, SIAM Journ. Comput. 8 (1979), 410–421.Google Scholar
  17. [17]
    K.W. Wagner, Some observations on the connection between counting and recursion, Theor. Comput. Sci. 47 (1986), 131–147.Google Scholar
  18. [18]
    S. Zachos, Probabilistic quantifiers, adversaries, and complexity classes: an overview, Proc. Structure in Complexity Theory Conf. 1986, Lecture Notes in Comput Science, Springer, 383–400.Google Scholar
  19. [19]
    S. Zachos and M. Fürer, Probabilistic quantifiers vs. distrustful adversaries, manuscript, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Johannes Köbler
    • 1
  • Uwe Schöning
    • 2
  • Jacobo Toran
    • 3
  1. 1.Universität StuttgartStuttgart 1
  2. 2.EWH KoblenzKoblenz
  3. 3.Facultat d'InformaticaBarcelona

Personalised recommendations