Results 271 to 280 of about 1,864,097 (296)
Some of the next articles are maybe not open access.
The parameterized complexity of counting problems
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., 2003We develop a parameterized complexity theory for counting problems. As the basis of this theory, we introduce a hierarchy of parameterized counting complexity classes #W$[t]$, for $t\ge 1$, that corresponds to Downey and Fellows's W-hierarchy [R. G. Downey and M. R.
Jörg Flum, Martin Grohe
openaire +3 more sources
Parameterized Complexity and Logic
2007We introduce and discuss some basic concepts of parameterized complexity theory via model-checking problems.
openaire +2 more sources
A Parameterized Complexity Tutorial
2012The article was prepared for the LATA 2012 conference where I will be presenting two one and half hour lectures for a short tutorial on parameterized complexity. Much fuller accounts can be found in the books Downey-Fellows [33, 34], Niedermeier [72], Flum-Grohe [49], the two issues of the Computer Journal [36] and the recent survey Downey-Thilikos [39]
openaire +1 more source
Descriptive and Parameterized Complexity
1999Descriptive Complexity Theory studies the complexity of problems of the following type: Given a finite structure A and a sentence Τ of some logic L, decide if A satisfies Τ? In this survey we discuss the parameterized complexity of such problems. Basically, this means that we ask under which circumstances we have an algorithm solving the problem ...
openaire +2 more sources
Parameterized power domination complexity
Information Processing Letters, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joachim Kneis +3 more
openaire +2 more sources
Fundamentals of Parameterized Complexity
2013Rodney G. Downey, Michael R. Fellows
openaire +1 more source
Integer Programming in Parameterized Complexity: Five Miniatures
Discrete Optimization, 2022Martin Koutecký +2 more
exaly
The Parameterized Complexity of Counting Problems
SIAM Journal on Computing, 2004Martin Grohe, Jörg Flum
exaly
Parameterized Complexity of Finding Subgraphs With Hereditary Properties
Theoretical Computer Science, 2002Venkatesh Raman, Subhash Khot
exaly
On the Space and Circuit Complexity of Parameterized Problems: Classes and Completeness
Algorithmica, 2015Till Tantau +2 more
exaly

