Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable

Recognition of minimal unsatisfiable CNF formulas (unsatisfiable CNF formulas which become satisfiable if any clause is removed) is a classical D P -complete problem. It was shown recently that minimal unsatisfiable formulas with n variables and n+ k clauses can be recognized in time n O(k) . We imp...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of computer and system sciences Ročník 69; číslo 4; s. 656 - 674
Hlavný autor:	Szeider, Stefan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.12.2004
Predmet:	Bipartite matching DP-complete problem Expansion Fixed-parameter complexity Minimal unsatisfiability SAT problem Tree-width Tree-width Fixed-parameter complexity SAT problem Minimal unsatisfiability Bipartite matching Expansion D P -complete problem
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!