W-hardness under linear FPT-reductions: structural properties and further applications

Authors:
Jianer Chen;Xiuzhen Huang;Iyad A. Kanj;Ge Xia
Affiliations:
Dept. of Computer Science, Texas A&M University, College Station, TX;Computer Science Department, Arkansas State University, State University, Arkansas;School of Computer Science, Telecommunications and Information Systems, DePaul University, Chicago, IL;Department of Computer Science, Lafayette College, Easton, PA
Venue:
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Year:
2005

Citing 14
Cited 4

On limited nondeterminism and the complexity of the V-C dimension

Journal of Computer and System Sciences
On fixed-parameter tractability and approximability of NP optimization problems

Journal of Computer and System Sciences - special issue on complexity theory
On the efficiency of polynomial time approximation schemes

Information Processing Letters
On the complexity of database queries

Journal of Computer and System Sciences
The parameterized complexity of database queries

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Vertex cover: further observations and further improvements

Journal of Algorithms
Which problems have strongly exponential complexity?

Journal of Computer and System Sciences
The inapproximability of non-NP-hard optimization problems

Theoretical Computer Science
On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Linear FPT reductions and computational lower bounds

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Tight Lower Bounds for Certain Parameterized NP-Hard Problems

CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Model-Checking Problems as a Basis for Parameterized Intractability

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Parameterized complexity and polynomial-time approximation schemes

Parameterized complexity and polynomial-time approximation schemes
Parameterized Complexity

Parameterized Complexity

Tight lower bounds for certain parameterized NP-hard problems

Information and Computation
Tight lower bounds for certain parameterized NP-hard problems

Information and Computation
A lower bound on approximation algorithms for the closest substring problem

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Lower bounds and parameterized approach for longest common subsequence

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.02

Visualization

Abstract

The notion of linear fpt-reductions has been recently used to derive strong computational lower bounds for well-known NP-hard problems. In this paper, we formally investigate the notions of W[t]-hardness and W[t]-completeness under the linear fpt-reduction, and study structural properties of the corresponding complexity classes. Additional complexity lower bounds on important computational problems are also established.