Pensum -10%
Hopp til hovedinnholdet
Parameterized Complexity in the Polynomial Hierarchy
Av Ronald de Haan, 2019.Del av serien Lecture Notes in Computer Science.
Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy
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.
PocketEngelsk
Normalpris: 949,-
854,-
Spar 95,-
Laveste pris siste 30 dager: 928,-
Ved å fullføre kjøpet aksepterer jeg kjøpsvilkårene.
Ikke tilgjengelig for Klikk&Hent
På nettlager. Bestilles fra England. Leveres normalt innen 5-8 virkedager.
Parameterized Complexity in the Polynomial Hierarchy
Av Ronald de Haan, 2019.Del av serien Lecture Notes in Computer Science.
Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy
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.
Normalpris: 949,-
854,-
Spar 95,-
Laveste pris siste 30 dager: 928,-
PocketEngelsk
Ved å fullføre kjøpet aksepterer jeg kjøpsvilkårene.
Ikke tilgjengelig for Klikk&Hent
På nettlager. Bestilles fra England. Leveres normalt innen 5-8 virkedager.
854,-
Ved å fullføre kjøpet aksepterer du kjøpsvilkårene.
