Ronald de Haan
Parameterized Complexity in the Polynomial Hierarchy. Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy, 2019 ed., Paperback
b90c4911-9dc0-5dbe-9cde-2c8012ea04b2
Vândut si livrat de:
Elefant
Cost livrare: va fi calculat in pagina de comanda.
504,99 lei
+505 puncte
|
|---|
room
Livrare gratuită
în Pickup Point de la 49.99 lei
swap_vertical_circle
Retur gratuit
Conform Termeni și condiții
assignment_turned_in
Verificare colet
Înainte de plată TEST
Descriere
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.
mai multmai putin more_horiz
- Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
- Author(s): Ronald de Haan
- Illustration(s): 1349 Illustrations, black and white; XI, 398 p. 1349 illus.
- Number of pages: 398
- Collection: Theoretical Computer Science and General Issues
- Publication date: 2019
- Dimensions: 234 x 156 x 27
- Cover type: Paperback / softback
Detalii
- Autor
- Ronald de Haan
- Editura
- Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
- Colectie
- Lecture Notes in Computer Science
- Anul aparitiei
- 2.019
- Luna aparitiei
- 12
- Tip coperta
- Brosata
- Numar de pagini
- 398
- Format
- 234 x 156
- ISBN
- 3662606690
- Cod de bare
- 9783662606698
- Tara de origine
- Germania