Strong computational lower bounds via parameterized complexity☆
Keywords
Cited by (0)
- ☆
A preliminary version of this paper “Linear FPT reductions and computational lower bounds” was presented at The 36th ACM Symposium on Theory of Computing, STOC 2004, Chicago, June 13–15, 2004 (see [J. Chen, X. Huang, I. Kanj, G. Xia, Linear FPT reductions and computational lower bounds, in: Proc. 36th ACM Symposium on Theory of Computing, STOC '04, 2004, pp. 212–221]).
- 1
Supported in part by USA National Science Foundation under Grants CCR-0311590 and CCF-0430683, and by China National Natural Science Foundation under Grants Nos. 60373083 and 60433020 while this author was at College of Information Science and Engineering, Central-South University, Changsha, Hunan 410083, PR China.
- 2
Supported in part by USA National Science Foundation under Grant CCR-0000206.
- 3
Supported in part by DePaul University Competitive Research Grant.
- 4
Supported in part by USA National Science Foundation under Grants CCR-0311590 and CCF-0430683.