On Miniaturized Problems in Parameterized Complexity Theory

Theoretical Computer Science - Netherlands
doi 10.1016/j.tcs.2005.10.003
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

On the Space Complexity of Parameterized Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Parameterized Complexity of Cardinality Constrained Optimization Problems

Computer Journal
Computer Science
2007English

Parameterized Complexity of Generalized Vertex Cover Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Parameterized Proof Complexity

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2011English

Parameterized Complexity and Approximability of Coverability Problems in Weighted Petri Nets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Counting and Finding Homomorphisms Is Universal for Parameterized Complexity Theory

2020English

On the Complexity of Undecidable Problems in Automata Theory

1967English

Lower Bounds for the Parameterized Complexity of Minimum Fill-In and Other Completion Problems

2015English

Upper Bounds on the Complexity of Some Galois Theory Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy