On the computational hardness based on linear FPT-reductions

Jianer Chen (), Xiuzhen Huang (), Iyad A. Kanj () and Ge Xia ()
Additional contact information
Jianer Chen: Texas A&M University
Xiuzhen Huang: State University
Iyad A. Kanj: DePaul University
Ge Xia: Lafayette College

Journal of Combinatorial Optimization, 2006, vol. 11, issue 2, No 9, 247 pages

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

Keywords: FPT-reduction; Linear; Hardness; Complexity (search for similar items in EconPapers)
Date: 2006
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-006-7137-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:11:y:2006:i:2:d:10.1007_s10878-006-7137-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-006-7137-6

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().