Characterizing parallel hierarchies by reducibilities
Information Processing Letters
Journal of the ACM (JACM)
On the Amount of Nondeterminism and the Power of Verifying
SIAM Journal on Computing
Circuit Bottom Fan-in and Computational Power
SIAM Journal on Computing
Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Vertex cover: further observations and further improvements
Journal of Algorithms
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Which problems have strongly exponential complexity?
Journal of Computer and System Sciences
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
On the existence of subexponential parameterized algorithms
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
An improved deterministic local search algorithm for 3-SAT
Theoretical Computer Science
On miniaturized problems in parameterized complexity theory
Theoretical Computer Science - Parameterized and exact computation
A Duality between Clause Width and Clause Density for SAT
CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
Strong computational lower bounds via parameterized complexity
Journal of Computer and System Sciences
Polynomial time approximation schemes and parameterized complexity
Discrete Applied Mathematics
The Complexity of Polynomial-Time Approximation
Theory of Computing Systems
An Isomorphism Between Subexponential and Parameterized Complexity Theory
SIAM Journal on Computing
Faster Algebraic Algorithms for Path and Packing Problems
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Finding paths of length k in O∗(2k) time
Information Processing Letters
Subexponential Time and Fixed-parameter Tractability
Journal of Logic and Computation
On parameterized exponential time complexity
Theoretical Computer Science
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation
On the possibility of faster SAT algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Determinant Sums for Undirected Hamiltonicity
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Improved deterministic algorithms for weighted matching and packing problems
Theoretical Computer Science
Non-uniform ACC Circuit Lower Bounds
CCC '11 Proceedings of the 2011 IEEE 26th Annual Conference on Computational Complexity
Slightly superexponential parameterized problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Parameterized Complexity and Approximation Algorithms
The Computer Journal
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
| Hi-index | 0.00 |
Since its inception in the 1990's, parameterized complexity has established itself as one of the major research areas in theoretical computer science. Parameterized and kernelization algorithms have proved to be very useful for solving important problems in various domains of science and technology. Moreover, parameterized complexity has shown deep connections to traditional areas of theoretical computer science, such as structural complexity theory and approximation algorithms. In this paper, we discuss some of the recent results pertaining to the relation between parameterized complexity and subexponential-time computability. We focus our attention on satisfiability problems because they play a key role in the definition of both parameterized complexity and structural complexity classes, and because they model numerous important problems in computer science.