Next Article in Journal / Special Issue
Parameterised Enumeration for Modification Problems
Previous Article in Journal
Using Graph Partitioning for Scalable Distributed Quantum Molecular Dynamics
Previous Article in Special Issue
Practical Access to Dynamic Programming on Tree Decompositions
Open AccessFeature PaperArticle

A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy

1
Institute for Logic, Language and Computation (ILLC), University of Amsterdam, 1000–1183 Amsterdam, The Netherlands
2
Algorithms and Complexity Group, Institute for Logic and Computation, Faculty of Informatics, Technische Universität Wien, 1040 Vienna, Austria
*
Author to whom correspondence should be addressed.
Algorithms 2019, 12(9), 188; https://doi.org/10.3390/a12090188
Received: 19 July 2019 / Revised: 30 August 2019 / Accepted: 3 September 2019 / Published: 9 September 2019
(This article belongs to the Special Issue New Frontiers in Parameterized Complexity and Algorithms)
We present a list of parameterized problems together with a complexity classification of whether they allow a fixed-parameter tractable reduction to SAT or not. These problems are parameterized versions of problems whose complexity lies at the second level of the Polynomial Hierarchy or higher. View Full-Text
Keywords: parameterized complexity; polynomial hierarchy; fpt-reductions parameterized complexity; polynomial hierarchy; fpt-reductions
Show Figures

Figure 1

MDPI and ACS Style

de Haan, R.; Szeider, S. A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy. Algorithms 2019, 12, 188.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map

1
Back to TopTop