Scilit logo
  • Rankings
  • Search Publications
    Cited-by Search
  • Sources
  • Publishers
  • Scholars
    Top Cited Scholars
  • Organizations
  • Scilit
    About Us
    Advisory Board
    Data Sources
    Career
    Support / Contact
    User Guide
    Publisher User
    Search Function
    Rankings Function
    API Resource
    Scilit Knowledge
    Metrics
    Scilit Recognitions
    Publications Classification
    Media
    News
    Blog
Register
  1. Home
  2. Publications
  3. Parameterized Complexity in the Polynomial Hierarchy
  1. Home
  2. Publications
  3. Parameterized Complexity in the Polynomial Hierarchy

Parameterized Complexity in the Polynomial Hierarchy

Author:
  • RHRonald de Haan
    Ronald de Haan

Publisher website
Google Scholar
  • 1 January 2019
    • book
    • Published by Springer Nature in Lecture Notes in Computer Science
    • DOI:10.1007/978-3-662-60670-4
Abstract
No abstract available
Keywords
  • COMPUTATIONAL COMPLEXITY
  • PARAMETERIZED COMPLEXITY
  • FIXED-PARAMETER TRACTABILITY
  • FPT-REDUCTIONS
  • POLYNOMIAL HIERARCHY
  • COMPLEXITY CLASSES
  • AUTOMATED REASONING
  • SAT SOLVING
  • ANSWER SET PROGRAMMING
  • SUBEXPONENTIAL-TIME COMPLEXITY
  • TEMPORAL LOGIC
Cited by 27 articles
Scilit logo

Have questions? Email us at support@scilit.com

© 2026 MDPI (Basel, Switzerland) unless otherwise stated.

MDPI initiatives

  • MDPI Journals
  • MDPI Books
  • Sciforum
  • Proceedings Series
  • Preprints.org
  • SciProfiles
  • Encyclopedia
  • JAMS

Legal

  • Privacy
  • Terms
  • About
  • Contact
  • Disclaimer

Follow us

  • facebook icon
  • x icon
  • linkedin icon

Join us

  • Career

© 2026 MDPI (Basel, Switzerland) unless otherwise stated.