Upper and Lower Bounds for Weak Backdoor Set Detection

D 2013

Upper and Lower Bounds for Weak Backdoor Set Detection

NEELDHARA, Misra, Sebastian ORDYNIAK, Venkatesh RAMAN a Stefan SZEIDER

Základní údaje

Originální název

Upper and Lower Bounds for Weak Backdoor Set Detection

Autoři

NEELDHARA, Misra (356 Indie), Sebastian ORDYNIAK (276 Německo, garant, domácí), Venkatesh RAMAN (356 Indie) a Stefan SZEIDER (40 Rakousko)

Vydání

Helsinki, Lecture Notes in Computer Science, od s. 394-402, 9 s. 2013

Nakladatel

Springer

Další údaje

Jazyk

angličtina

Typ výsledku

Stať ve sborníku

Obor

10000 1. Natural Sciences

Stát vydavatele

Německo

Utajení

není předmětem státního či obchodního tajemství

Forma vydání

tištěná verze "print"

Impakt faktor

Impact factor: 0.402 v roce 2005

Kód RIV

RIV/00216224:14330/13:00072818

Organizační jednotka

Fakulta informatiky

ISBN

978-3-642-39070-8

ISSN

DOI

http://dx.doi.org/10.1007/978-3-642-39071-5_29

Klíčová slova anglicky

satisfiability; weak backdoor sets;parameterized complexity; upper bounds; lower bounds

Příznaky

Mezinárodní význam, Recenzováno

Změněno: 28. 4. 2014 09:30, RNDr. Pavel Šmerk, Ph.D.

Anotace

V originále

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.

Návaznosti

EE2.3.30.0009, projekt VaV

Název: Zaměstnáním čerstvých absolventů doktorského studia k vědecké excelenci

Citovat

NEELDHARA, Misra, Sebastian ORDYNIAK, Venkatesh RAMAN a Stefan SZEIDER. Upper and Lower Bounds for Weak Backdoor Set Detection. In Matti J{\"a}rvisalo and Allen Van Gelder. 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.

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

Podrobný výpis o publikaci