Redirigiendo al acceso original de articulo en 22 segundos...
Inicio  /  Algorithms  /  Vol: 12 Par: 9 (2019)  /  Artículo
ARTÍCULO
TITULO

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

Ronald de Haan and Stefan Szeider    

Resumen

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.

 Artículos similares