Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP

2015 ◽  
pp. 217-229 ◽  
Author(s):  
Ronald de Haan ◽  
Stefan Szeider
Keyword(s):  
Parameterized Complexity ◽  
Complexity Classes

scholarly journals Parameterized complexity classes beyond para-NP

2017 ◽  
Vol 87 ◽  
pp. 16-57 ◽  
Author(s):  
Ronald de Haan ◽  
Stefan Szeider
Keyword(s):  
Parameterized Complexity ◽  
Complexity Classes

scholarly journals Describing parameterized complexity classes

2003 ◽  
Vol 187 (2) ◽  
pp. 291-319 ◽  
Author(s):  
Jörg Flum ◽  
Martin Grohe
Keyword(s):  
Parameterized Complexity ◽  
Complexity Classes

Logical Decision Problems and Complexity of Logic Programs

1987 ◽  
Vol 10 (1) ◽  
pp. 1-33
Author(s):  
Egon Börger ◽  
Ulrich Löwen
Keyword(s):  
Fixed Point ◽  
Computational Complexity ◽  
Decision Problem ◽  
Decision Problems ◽  
Complexity Classes ◽  
Logic Programs ◽  
Finite Structures ◽  
Syntactic Restrictions

We survey and give new results on logical characterizations of complexity classes in terms of the computational complexity of decision problems of various classes of logical formulas. There are two main approaches to obtain such results: The first approach yields logical descriptions of complexity classes by semantic restrictions (to e.g. finite structures) together with syntactic enrichment of logic by new expressive means (like e.g. fixed point operators). The second approach characterizes complexity classes by (the decision problem of) classes of formulas determined by purely syntactic restrictions on the formation of formulas.

On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances

2017 ◽  
Vol 18 (3) ◽  
pp. 1-46
Author(s):  
Ronald De Haan ◽  
Iyad Kanj ◽  
Stefan Szeider
Keyword(s):  
Parameterized Complexity ◽  
Cnf Formulas

Parameterized complexity of fair feedback vertex set problem

2021 ◽  
Vol 867 ◽  
pp. 1-12
Author(s):  
Lawqueen Kanesh ◽  
Soumen Maity ◽  
Komal Muluk ◽  
Saket Saurabh
Keyword(s):  
Parameterized Complexity ◽  
Feedback Vertex Set ◽  
Vertex Set ◽  
Feedback Vertex Set Problem

A compendium of parameterized complexity results

1994 ◽  
Vol 25 (3) ◽  
pp. 122-123 ◽  
Author(s):  
Michael T. Hallett ◽  
H. Todd Wareham
Keyword(s):  
Parameterized Complexity ◽  
Complexity Results
Sign in / Sign up

Export Citation Format

Share Document