Parameterized Complexity in the Polynomial Hierarchy - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

17

(FIVE YEARS 17)

H-INDEX

0

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783662606698, 9783662606704

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A New Completeness Theory

Parameterized Complexity in the Polynomial Hierarchy - Lecture Notes in Computer Science ◽

10.1007/978-3-662-60670-4_6 ◽

2019 ◽

pp. 85-135

Author(s):

Ronald de Haan

Download Full-text

Open Problems and Future Research Directions

Parameterized Complexity in the Polynomial Hierarchy - Lecture Notes in Computer Science ◽

10.1007/978-3-662-60670-4_16 ◽

2019 ◽

pp. 335-347

Author(s):

Ronald de Haan

Keyword(s):

Future Research ◽

Open Problems ◽

Research Directions ◽

Future Research Directions

Download Full-text

Graph Problems

Parameterized Complexity in the Polynomial Hierarchy - Lecture Notes in Computer Science ◽

10.1007/978-3-662-60670-4_13 ◽

2019 ◽

pp. 261-268

Author(s):

Ronald de Haan

Keyword(s):

Download Full-text

Problems in Judgment Aggregation

Parameterized Complexity in the Polynomial Hierarchy - Lecture Notes in Computer Science ◽

10.1007/978-3-662-60670-4_11 ◽

2019 ◽

pp. 219-250

Author(s):

Ronald de Haan

Keyword(s):

Judgment Aggregation

Download Full-text

Problems in Knowledge Representation and Reasoning

Parameterized Complexity in the Polynomial Hierarchy - Lecture Notes in Computer Science ◽

10.1007/978-3-662-60670-4_8 ◽

2019 ◽

pp. 161-179

Author(s):

Ronald de Haan

Keyword(s):

Knowledge Representation ◽

Knowledge Representation And Reasoning

Download Full-text

Planning Problems

Parameterized Complexity in the Polynomial Hierarchy - Lecture Notes in Computer Science ◽

10.1007/978-3-662-60670-4_12 ◽

2019 ◽

pp. 251-259

Author(s):

Ronald de Haan

Keyword(s):

Planning Problems

Download Full-text

Introduction

Parameterized Complexity in the Polynomial Hierarchy - Lecture Notes in Computer Science ◽

10.1007/978-3-662-60670-4_1 ◽

2019 ◽

pp. 1-18

Author(s):

Ronald de Haan

Download Full-text

Model Checking for Temporal Logics

Parameterized Complexity in the Polynomial Hierarchy - Lecture Notes in Computer Science ◽

10.1007/978-3-662-60670-4_9 ◽

2019 ◽

pp. 181-204

Author(s):

Ronald de Haan

Keyword(s):

Model Checking ◽

Temporal Logics

Download Full-text

The Need for a New Completeness Theory

Parameterized Complexity in the Polynomial Hierarchy - Lecture Notes in Computer Science ◽

10.1007/978-3-662-60670-4_5 ◽

2019 ◽

pp. 71-83

Author(s):

Ronald de Haan

Download Full-text

Conclusion

Parameterized Complexity in the Polynomial Hierarchy - Lecture Notes in Computer Science ◽

10.1007/978-3-662-60670-4_17 ◽

2019 ◽

pp. 349-353

Author(s):

Ronald de Haan

Download Full-text