Lecture notes in computer science (26 résultats)

Etat : New.

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

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

Etat : As New. Unread book in perfect condition.

Etat : New.

Paperback. Etat : New.

Etat : New.

Etat : As New. Unread book in perfect condition.

Etat : New. In English.

Paperback. Etat : New. 2019 ed. 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.…

Paperback. Etat : New.

Etat : NEW.

Etat : New.

Taschenbuch. Etat : 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.…

Etat : New. pp. 412.

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

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

Taschenbuch. Etat : 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. …

Paperback. Etat : New. 2019 ed. 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.…

Paperback. Etat : New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Etat : new. Questo è un articolo print on demand.

Paperback. Etat : Brand New. 412 pages. 9.25x6.10x0.98 inches. In Stock. This item is printed on demand.

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 412 pp. Englisch.…

Etat : New. PRINT ON DEMAND pp. 412.

Etat : New. Print on Demand pp. 412.

Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 412 pp. Englisch.…