Parameterized Complexity in the Polynomial Hierarchy

Extending Parameterized Complexity Theory to Higher Levels of the 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.

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.

UK Delivery:

• Free delivery on all orders of £10 or more.
• £1.49 delivery fee on orders below £10.
• UK orders are shipped via Royal Mail 2nd Class.

International Delivery:

• Flat rate delivery charges vary by country.

Dispatch and Delivery Times:

• All orders are shipped from our warehouse in Northampton, UK within 48 hours of receipt during working hours.
• UK mainland orders typically arrive within 3-5 working days via Royal Mail 2nd Class.
• International estimated delivery times:
• Europe & Channel Islands: 7 to 10 working days
• USA: 7 to 15 working days
• Rest of the World: 9 to 21 working days

View our full delivery infomation here.