Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Characterizing parallel hierarchies by reducibilities
Information Processing Letters
A polynomial algorithm for the k-cut problem for fixed k
Mathematics of Operations Research
The minimum feature set problem
Neural Networks
On limited nondeterminism and the complexity of the V-C dimension
Journal of Computer and System Sciences
Vertex cover: further observations and further improvements
Journal of Algorithms
Which problems have strongly exponential complexity?
Journal of Computer and System Sciences
Combinatorial Approaches to Finding Subtle Signals in DNA Sequences
Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology
On Limited versus Polynomial Nondeterminism
On Limited versus Polynomial Nondeterminism
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
The k-feature set problem is W[2]-complete
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Solving large FPT problems on coarse-grained parallel machines
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
On the existence of subexponential parameterized algorithms
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Polynomial algorithm for the k-cut problem
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
W-hardness under linear FPT-reductions: structural properties and further applications
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Parameterized Complexity
Strong computational lower bounds via parameterized complexity
Journal of Computer and System Sciences
Genus characterizes the complexity of certain graph problems: Some tight results
Journal of Computer and System Sciences
On the parameterized complexity of d-dimensional point set pattern matching
Information Processing Letters
Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On parameterized exponential time complexity
Theoretical Computer Science
Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability
Artificial Intelligence
Hi-index | 0.00 |
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by proving a general result, namely that the parameterized weighted satisfiability problem on depth-t circuits cannot be solved in time nO(k)mO(1), where n is the circuit input length, m is the circuit size, and k is the parameter, unless the (t - 1)- st level W[t-1] of the W-hierarchy collapses to FPT. By refining this technique, we prove that a group of parameterized NP-hard problems, including weighted sat, hitting set, set cover, and feature set, cannot be solved in time no(k)mO(1), where n is the size of the universal set from which the k elements are to be selected and m is the instance size, unless the first level W[1] of the W-hierarchy collapses to FPT. We also prove that another group of parameterized problems which includes WEIGHTED q-SAT (for any fixed q ≥ 2), CLIQUE, INDEPENDENT SET, and DOMINATING SET, cannot be solved in time no(k) unless all search problems in the syntactic class SNP, introduced by Papadimitriou and Yannakakis, are solvable in subexponential time. Note that all these parameterized problems have trivial algorithms of running time either nkmO(1) or O(nk).