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

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.

Bibliographic Details
Main Authors:	Ronald de Haan, Stefan Szeider
Format:	Article
Language:	English
Published:	MDPI AG 2019-09-01
Series:	Algorithms
Subjects:	parameterized complexity polynomial hierarchy fpt-reductions
Online Access:	https://www.mdpi.com/1999-4893/12/9/188

id	doaj-9adc8f3407254d1da3e985da5a930817
record_format	Article
spelling	doaj-9adc8f3407254d1da3e985da5a9308172020-11-25T01:51:12ZengMDPI AGAlgorithms1999-48932019-09-0112918810.3390/a12090188a12090188A Compendium of Parameterized Problems at Higher Levels of the Polynomial HierarchyRonald de Haan0Stefan Szeider1Institute for Logic, Language and Computation (ILLC), University of Amsterdam, 1000–1183 Amsterdam, The NetherlandsAlgorithms and Complexity Group, Institute for Logic and Computation, Faculty of Informatics, Technische Universität Wien, 1040 Vienna, AustriaWe 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.https://www.mdpi.com/1999-4893/12/9/188parameterized complexitypolynomial hierarchyfpt-reductions
collection	DOAJ
language	English
format	Article
sources	DOAJ
author	Ronald de Haan Stefan Szeider
spellingShingle	Ronald de Haan Stefan Szeider A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy Algorithms parameterized complexity polynomial hierarchy fpt-reductions
author_facet	Ronald de Haan Stefan Szeider
author_sort	Ronald de Haan
title	A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy
title_short	A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy
title_full	A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy
title_fullStr	A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy
title_full_unstemmed	A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy
title_sort	compendium of parameterized problems at higher levels of the polynomial hierarchy
publisher	MDPI AG
series	Algorithms
issn	1999-4893
publishDate	2019-09-01
description	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.
topic	parameterized complexity polynomial hierarchy fpt-reductions
url	https://www.mdpi.com/1999-4893/12/9/188
work_keys_str_mv	AT ronalddehaan acompendiumofparameterizedproblemsathigherlevelsofthepolynomialhierarchy AT stefanszeider acompendiumofparameterizedproblemsathigherlevelsofthepolynomialhierarchy AT ronalddehaan compendiumofparameterizedproblemsathigherlevelsofthepolynomialhierarchy AT stefanszeider compendiumofparameterizedproblemsathigherlevelsofthepolynomialhierarchy
_version_	1724997947481915392

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

Similar Items