Parameterized Complexity and Logic

Authors:
Jörg Flum
Affiliations:
Abteilung für Mathematische Logik, Universität Freiburg, Eckerstr. 1, 79104 Freiburg, Germany
Venue:
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Year:
2007

Citing 5
Cited 0

On the complexity of database queries

Journal of Computer and System Sciences
Fixed-Parameter Tractability, Definability, and Model-Checking

SIAM Journal on Computing
The complexity of relational query languages (Extended Abstract)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Bounded fixed-parameter tractability and log2n nondeterministic bits

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce and discuss some basic concepts of parameterized complexity theory via model-checking problems.