Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{1173833,
author = {Neeldhara, Misra and Ordyniak, Sebastian and Raman, Venkatesh and Szeider, Stefan},
address = {Helsinki},
booktitle = {Lecture Notes in Computer Science},
doi = {http://dx.doi.org/10.1007/978-3-642-39071-5_29},
editor = {Matti J{\"a}rvisalo and Allen Van Gelder},
keywords = {satisfiability; weak backdoor sets;parameterized complexity; upper bounds; lower bounds},
howpublished = {tištěná verze "print"},
language = {eng},
location = {Helsinki},
isbn = {978-3-642-39070-8},
pages = {394-402},
publisher = {Springer},
title = {Upper and Lower Bounds for Weak Backdoor Set Detection},
year = {2013}
}
TY - JOUR
ID - 1173833
AU - Neeldhara, Misra - Ordyniak, Sebastian - Raman, Venkatesh - Szeider, Stefan
PY - 2013
TI - Upper and Lower Bounds for Weak Backdoor Set Detection
PB - Springer
CY - Helsinki
SN - 9783642390708
KW - satisfiability
KW - weak backdoor sets;parameterized complexity
KW - upper bounds
KW - lower bounds
N2 - We obtain upper and lower bounds for running times of exponential time algorithms for the detection of weak backdoor sets of 3CNF formulas, considering various base classes. These results include (omitting polynomial factors), (i)~a 4.54^k algorithm to detect whether there is a weak backdoor set of at most k variables into the class of Horn formulas; (ii)~a 2.27^k algorithm to detect whether there is a weak backdoor set of at most k variables into the class of Krom formulas. These bounds improve an earlier known bound of 6^k. We also prove a 2^k lower bound for these problems, subject to the Strong Exponential Time Hypothesis.
ER -
NEELDHARA, Misra, Sebastian ORDYNIAK, Venkatesh RAMAN a Stefan SZEIDER. Upper and Lower Bounds for Weak Backdoor Set Detection. In Matti J$\{\backslash$''a$\}$rvisalo and Allen Van Gelder. \textit{Lecture Notes in Computer Science}. Helsinki: Springer, 2013, s.~394-402. ISBN~978-3-642-39070-8. Dostupné z: https://dx.doi.org/10.1007/978-3-642-39071-5\_{}29.
|
