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...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of computer and system sciences Ročník 72; číslo 8; s. 1346 - 1367
Hlavní autori:	Chen, Jianer, Huang, Xiuzhen, Kanj, Iyad A., Xia, Ge
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.12.2006
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!