Lecture notes in computer science - 1-teilige buchserie (9 Ergebnisse)

PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Zustand: New. In English.

Zustand: NEW.

Zustand: New.

Zustand: New. Fixed-parameter tractable reductionsParameterized complexity Polynomial HierarchyComputational ComplexityFixed-parameter tractable reductionsParameterized complexityPolynomial H.

Paperback. Zustand: Brand New. 412 pages. 9.25x6.10x0.98 inches. In Stock.

Taschenbuch. Zustand: Neu. Parameterized Complexity in the Polynomial Hierarchy | Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy | Ronald de Haan | Taschenbuch | xi | Englisch | 2019 | Springer | EAN 9783662606698 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…