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

Full description

Bibliographic Details

Published in:	Journal of computer and system sciences Vol. 142; p. 103520
Main Authors:	Dreier, Jan, Ordyniak, Sebastian, Szeider, Stefan
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.06.2024
Subjects:	Backdoor Elimination distance Parameterized algorithms SAT Satisfiability Elimination distance Backdoor Parameterized algorithms Satisfiability SAT
ISSN:	0022-0000, 1090-2724
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!