Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Parameterized Complexity and Logic

  • Conference paper
Computation and Logic in the Real World (CiE 2007)

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

Included in the following conference series:

  • 1279 Accesses

Abstract

We introduce and discuss some basic concepts of parameterized complexity theory via model-checking problems.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Büchi, J.R.: Weak second-order arithmetic and finite automata. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 6, 66–92 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  2. Downey, R.G., Fellows, M.R.: Parameterized computational feasibility. In: Clote, P., Remmel, J.B. (eds.) Proceedings of Feasible Mathematics II, Birkhäuser, pp. 219–244 (1995)

    Google Scholar 

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

    Book  MATH  Google Scholar 

  4. Downey, R.G., Fellows, M.R., Regan, K.: Descriptive complexity and the W-hierarchy. In: Beame, P., Buss, S. (eds.) Proof Complexity and Feasible Arithmetic, volume 39 of AMS-DIMACS Volume Series, AMS, pp. 119–134 (1998)

    Google Scholar 

  5. Elgot, J.C.C.: Decision problems of finite automata design and related arithmetics. Transactions of the American Mathematical Society 98, 21–51 (1961)

    Article  MathSciNet  MATH  Google Scholar 

  6. Flum, J., Grohe, M.: Fixed-parameter tractability, definability, and model checking. SIAM Journal on Computing 31(1), 113–145 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  7. Flum, J., Grohe, M.: Model-checking problems as a basis for parameterized intractability. Logical Methods in Computer Science, 1(1) (2004)

    Google Scholar 

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

    MATH  Google Scholar 

  9. Flum, J., Grohe, M., Weyer, M.: Bounded fixed-parameter tractability and log2 n nondeterministic bits. Journal of Computer and System Sciences 72, 34–71 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  10. Frick, M., Grohe, M.: The complexity of first-order and monadic second-order logic revisited. Annals of Pure. and Applied Logic 130, 3–31 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  11. Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford Press (2006)

    Google Scholar 

  12. Papadimitriou, C.H., Yannakakis, M.: On limited nondeterminism and the complexity of the VC-dimension. Journal of Computer and System Sciences 43, 425–440 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  13. Papadimitriou, C.H., Yannakakis, M.: On the complexity of database queries. Journal of Computer and System Sciences 58, 407–427 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  14. Trakhtenbrot, B.: Finite Automata and the Logic of Monadic Predicates. Doklady Akademii Nauk. SSSR 140, 326–329 (1961)

    Google Scholar 

  15. Vardi, M.Y.: The complexity of relational query languages. In: Proceedings of the 14th ACM Symposium on Theory of Computing, pp. 137–146 (1982)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Abteilung für Mathematische Logik, Universität Freiburg, Eckerstr. 1, 79104 Freiburg, Germany

    Jörg Flum

Authors
  1. Jörg Flum
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Pure Mathematics, University of Leeds, LS2 9JT, Leeds, UK

    S. Barry Cooper

  2. Institue for Logic, Language and Computation (ILLC), Universiteit van Amsterdam, Plantage Muidergracht 24, 1018, TV Amsterdam, The Netherlands

    Benedikt Löwe

  3. Dipartimento di Scienze Matematiche ed Informatiche “R. Magari”, University of Siena, 53100, Siena, Italy

    Andrea Sorbi

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Flum, J. (2007). Parameterized Complexity and Logic. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds) Computation and Logic in the Real World. CiE 2007. Lecture Notes in Computer Science, vol 4497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73001-9_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73001-9_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73000-2

  • Online ISBN: 978-3-540-73001-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation