scientific article; zbMATH DE number 2165693

MaRDI QIDQ4675622zbMATH OpenFDO

Authors Daoyun Xu

Publication date 6 May 2005

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Complexity of proofs (03F20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Homomorphisms of conjunctive normal forms.
• Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency.
• The complexity of homomorphisms and renamings for minimal unsatisfiable formulas
• Minimally unsatisfiable CNF formulas
• Complexity results on minimal unsatisfiable formulas

Cited in

(2)

• Homomorphisms of conjunctive normal forms.
• scientific article; zbMATH DE number 139628 (Why is no real title available?)

This page was built for publication:

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