Strong computational lower bounds via parameterized complexity

We develop new techniques for deriving strong computational lower bounds for a class of well-known NP-hard problems. This class includes weighted satisfiability, dominating set, hitting set, set cover, clique, and independent set. For example, although a trivial enumeration can easily test in time O...

Full description

Bibliographic Details

Published in:	Journal of computer and system sciences Vol. 72; no. 8; pp. 1346 - 1367
Main Authors:	Chen, Jianer, Huang, Xiuzhen, Kanj, Iyad A., Xia, Ge
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.12.2006
Subjects:	Clique Computational complexity Lower bound Parameterized computation Polynomial time approximation scheme Lower bound Clique Polynomial time approximation scheme Parameterized computation Computational complexity
ISSN:	0022-0000, 1090-2724
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!