Matched formulas and backdoor sets

MaRDI QIDQ3181640zbMATH OpenFDO

Authors Stefan Szeider

Publication date 12 October 2009

zbMATH Keywords

maximum deficiencyparameterized complexity

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Matched Formulas and Backdoor Sets
• Backdoors to satisfaction
• Backdoors into two occurrences
• Backdoor sets for DLL subsolvers
• Backdoors to acyclic SAT

Cited in

(6)

• Backdoors to tractable answer set programming
• Backdoors to satisfaction
• Matched Formulas and Backdoor Sets
• Backdoors into two occurrences
• Backdoor DNFs
• Backdoors into heterogeneous classes of SAT and CSP

This page was built for publication: Matched formulas and backdoor sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3181640)