Join thousands of book lovers
Sign up to our newsletter and receive discounts and inspiration for your next reading experience.
By signing up, you agree to our Privacy Policy.You can, at any time, unsubscribe from our newsletters.
Parameterized Complexity in the Polynomial Hierarchy
- Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy
part of the Lecture Notes in Computer Science series
part of the Theoretical Computer Science and General Issues series
- Language:
- English
- ISBN:
- 9783662606698
- Binding:
- Paperback
- Pages:
- 398
- Published:
- December 30, 2019
- Edition:
- 12019
- Dimensions:
- 155x235x0 mm.
- Weight:
- 629 g.
Delivery:
2-4 weeks
Expected delivery: December 26, 2024
Extended return policy to January 30, 2025
Description of Parameterized Complexity in the Polynomial Hierarchy
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.
User ratings of Parameterized Complexity in the Polynomial Hierarchy
Rate this book
In order to rate this book you must be logged in.Others also bought..
Find similar books
The book Parameterized Complexity in the Polynomial Hierarchy can be found in the following categories:
You can, at any time, unsubscribe from our newsletters.
© 2024 Tales
All packages are shipped from our warehouse in the UK.
Company address: Esromgade 15, 3. - 2200 - DK
Registered company number: DK43351621
