SAT backdoors: Depth beats size

For several decades, much effort has been put into identifying classes of CNF formulas whose satisfiability can be decided in polynomial time. Classic results are the linear-time tractability of Horn formulas (Aspvall, Plass, and Tarjan, 1979) and Krom (i.e., 2CNF) formulas (Dowling and Gallier, 198...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of computer and system sciences Ročník 142; s. 103520
Hlavní autori:	Dreier, Jan, Ordyniak, Sebastian, Szeider, Stefan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.06.2024
Predmet:	Backdoor Elimination distance Parameterized algorithms SAT Satisfiability Elimination distance Backdoor Parameterized algorithms Satisfiability SAT
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!