Name: Parameterized Complexity in the Polynomial Hierarchy: Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy (Theoretical Computer Science and General Issues) (en Inglés)
SKU: 62094111
Price: 80.37 USD
Availability: InStock
Author: Ronald De Haan

portada Parameterized Complexity in the Polynomial Hierarchy: Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy (Theoretical Computer Science and General Issues) (en Inglés)

Parameterized Complexity in the Polynomial Hierarchy: Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy (Theoretical Computer Science and General Issues) (en Inglés)

Formato

Libro Físico

Editorial

Springer

Autor

Ronald De Haan

Idioma

Inglés

N° páginas

409

Encuadernación

Tapa Blanda

ISBN13

9783662606698

N° edición

Parameterized Complexity in the Polynomial Hierarchy: Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy (Theoretical Computer Science and General Issues) (en Inglés)

Ronald De Haan (Autor) · Springer · Tapa Blanda

Libro Nuevo Importado

Envío: 16 a 23 días háb.

$ 160.74$ 80.37

-50%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan más de 100 unidades

$ 80.37

Llega entre el 15 Sep y el 28 Sep a Quito, Pichincha. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Parameterized Complexity in the Polynomial Hierarchy: Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy (Theoretical Computer Science and General Issues) (en Inglés)"

Parameterized Complexity in the Polynomial Hierarchy was co-recipient of the E.W. Beth Dissertation Prize 2017 for outstanding dissertations in the fields of logic, language, and information. This work extends the theory of parameterized complexity to higher levels of the Polynomial Hierarchy (PH). For problems at higher levels of the PH, a promising solving approach is to develop fixed-parameter tractable reductions to SAT, and to subsequently use a SAT solving algorithm to solve the problem. In this dissertation, a theoretical toolbox is developed that can be used to classify in which cases this is possible. The use of this toolbox is illustrated by applying it to analyze a wide range of problems from various areas of computer science and artificial intelligence.