SpringerLink
Log in

Problems Related to Propositional Satisfiability

  • Chapter
  • First Online:
Parameterized Complexity in the Polynomial Hierarchy

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

  • 465 Accesses

Abstract

In this chapter, we continue the parameterized complexity investigation of problems at higher levels of the Polynomial Hierarchy using the parameterized complexity tools that we developed in Chaps. 4–7. We look at several parameterized variants of problems related to propositional satisfiability.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
EUR 29.95
Price includes VAT (Germany)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 67.40
Price includes VAT (Germany)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 85.59
Price includes VAT (Germany)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Author information

Authors and Affiliations

  1. Institute for Logic, Language and Computation, University of Amsterdam, Amsterdam, The Netherlands

    Ronald de Haan

Authors
  1. Ronald de Haan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ronald de Haan .

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer-Verlag GmbH Germany, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

de Haan, R. (2019). Problems Related to Propositional Satisfiability. In: Parameterized Complexity in the Polynomial Hierarchy. Lecture Notes in Computer Science(), vol 11880. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-60670-4_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-60670-4_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-60669-8

  • Online ISBN: 978-3-662-60670-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation