Skip to main content
SpringerLink
Log in

Randomized Approximations of Parameterized Counting Problems

  • Conference paper
Parameterized and Exact Computation (IWPEC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4169))

Included in the following conference series:

Abstract

We prove that each parameterized counting problem in the class #[P] has a randomized fpt approximation algorithm using a W[P] oracle. Analoguous statements hold for #W[t] and #A[t] for each t≥1. These results are parameterized analogues of a theorem due to O.Goldreich and L.Stockmeyer.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arvind, V., Raman, V.: Approximation Algorithms for Some Parameterized Counting Problems. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 453–464. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Chen, Y., Flum, J., Grohe, M.: Machine-Based Methods in Parameterized Complexity Theory. Theoretical Computer Science 339, 167–199 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  3. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)

    Google Scholar 

  4. Downey, R.G., Fellows, M.R., Regan, K.W.: Parameterized Circuit Complexity and the W Hierachy. Theoretical Computer Science 191(1-2), 97–115 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  5. Flum, J., Grohe, M.: The Parameterized Complexity of Counting Problems. SIAM Journal on Computing 33(4), 892–922 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  6. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)

    Google Scholar 

  7. Goldreich, O.: Randomized Methods in Computation - Lecture Notes (2001), http://www.wisdom.weizmann.ac.il/~oded/homepage.html

  8. Jerrum, M.: Counting, Sampling and Intergrating: Algorithms and Complexity. Birkhäuser, Basel (2003)

    MATH  Google Scholar 

  9. Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On Generating All Maximal Independent Sets. Information Processing Letters 27, 119–123 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  10. Luby, M., Wigderson, A.: Pairwise Independence and Derandomization. International Computer Science Institute, TR-95-035 (1995)

    Google Scholar 

  11. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  12. Stockmeyer, L.: On Approximation Algorithms for #P. SIAM Journal on Computing 14(4), 849–861 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  13. Toda, S.: PP is as Hard as the Polynomial Hierarchy. SIAM Journal on Computing 20(5), 865–877 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  14. Valiant, L.G.: The Complexity of Enumeration and Reliability Problems. SIAM Journal on Computing 8(3), 410–421 (1979)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Abteilung für mathematische Logik, Albert-Ludwigs-Universität Freiburg, Eckerstr.1, 79104, Freiburg, Germany

    Moritz Müller

Authors
  1. Moritz Müller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Information and Computing Sciences, Utrecht University, The Netherlands

    Hans L. Bodlaender

  2. University of Tennessee, 37996-3450, Knoxville, Tennessee, U.S.A.

    Michael A. Langston

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Müller, M. (2006). Randomized Approximations of Parameterized Counting Problems. In: Bodlaender, H.L., Langston, M.A. (eds) Parameterized and Exact Computation. IWPEC 2006. Lecture Notes in Computer Science, vol 4169. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11847250_5

Download citation

  • DOI: https://doi.org/10.1007/11847250_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-39098-5

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation