Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1988: Mathematical Foundations of Computer Science 1988 pp 472–482Cite as

On complexity of counting

  • Communications
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 324))

Abstract

Let l, u: ℕ→ℕ, l<u. We give a full characterization of intervals [l, u] such that a polynomial-time ATM of a constant numer of alternations can verify the number of words of a given length and in a given (as its oracle) set A, provided that A's density function is in [l, u]. We prove also a new lower bound on the approximate counting: there is a recursive set A whose elements cannot be approximate counted in Σ p, A2 ∪ Π p, A2 .

This research was supported by the grant RP. I. 09 from the Institute of Informatics, University of Warsaw and the grant CPBP 01. 01 from the Institute of Mathematics, Polish Academy of Science.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Ajtai, Σ 11 formulas on finite structures, Annals of Pure and Applied Logic 24(1983), 1–48.

    Google Scholar 

  2. J. Balcazar, R. V. Book and U. Shonning, On bounded query machines, Theoret. Comp. Sci. 40(1985), 237–243.

    Google Scholar 

  3. M. Furst, J. B. Saxe and M. Sipser, Parity, Circuits and the Polynomial-Time Hierarchy, Proc. 22nd FOCS(1981), 260–270.

    Google Scholar 

  4. J. Hastad, Almost optimal lower bounds for small depth circuits, Proc. 18th ACM STOC(1986), 6–20.

    Google Scholar 

  5. C. H. Papadimitriou and M. Yannakakis, The complexity of facets (and some facets of complexity), J. Comput. Syst. Sci. 28(1984), 244–259.

    Google Scholar 

  6. J. Paris and A. Wilkie, Counting problems in bounded arithmetic, Springer Lecture Notes in Mathematics 1130, Methods in Mathematical Logic, Proc. Caracas(1983), 317–340.

    Google Scholar 

  7. M. Piotrow, On complexity of counting in polynomial hierarchy, TR N-166, Ins. Comp. Sci., Univ. of Wrocław, Poland.

    Google Scholar 

  8. L. J. Stockmeyer, The polynomial time hierarchy, Theoret. Comp. Sci. 3(1977), 1–22.

    Google Scholar 

  9. L. J. Stockmeyer, The complexity of approximate counting, Proc. 15th ACM STOC (1983), 118–126.

    Google Scholar 

  10. L. G. Valiant, The complexity of computing the permanent, Theoret. Comp. Sci. 8(1979), 189–201.

    Google Scholar 

  11. A. C. C. Yao, Separating the polynomial time hierarchy by oracles, Proc. 26th FOCS (1985), 1–10.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Wrocław, Przesmyckiego 20, 51-151, Wrocław, Poland

    Marek Piotrow

Authors
  1. Marek Piotrow
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michal P. Chytil Václav Koubek Ladislav Janiga

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Piotrow, M. (1988). On complexity of counting. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017170

Download citation

  • DOI: https://doi.org/10.1007/BFb0017170

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50110-7

  • Online ISBN: 978-3-540-45926-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation