Results 271 to 280 of about 1,615,597 (299)

On parameterized exponential time complexity

Theoretical Computer Science, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianer Chen, Iyad Kanj, Ge Xia
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Parameterized Random Complexity

Theory of Computing Systems, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Juan Andrés Montoya, Moritz Müller
openaire   +1 more source

The Parameterized Complexity of Stabbing Rectangles

Algorithmica, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael Dom, Michael R. Fellows, Frances A. Rosamond, Somnath Sikdar   +3 more
openaire   +2 more sources

The parameterized complexity of counting problems

The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jörg Flum, Martin Grohe
openaire   +3 more sources

Descriptive and Parameterized Complexity

1999
Descriptive 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

A Parameterized Complexity Tutorial

2012
The 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

Parameterized Complexity and Logic

2007
We introduce and discuss some basic concepts of parameterized complexity theory via model-checking problems.
openaire   +2 more sources

Parameterized power domination complexity

Information Processing Letters, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joachim Kneis, Daniel Mölle, Stefan Richter 0001, Peter Rossmanith   +3 more
openaire   +2 more sources

Fundamentals of Parameterized Complexity

2013
Rodney G. Downey, Michael R. Fellows
openaire   +1 more source

Integer programming in parameterized complexity: Five miniatures

Discrete Optimization, 2022
Martin Koutecký, Tomáš Gavenčiak, Dušan Knop   +2 more
exaly