scientific article; zbMATH DE number 1206044

MaRDI QIDQ4209085zbMATH OpenFDO

Authors E. Ya. Dantsin

Publication date 14 October 1998

zbMATH Keywords

effectivenessNP completeness

Mathematics Subject Classification ID

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

Cited in

(5)

• Polynomial algorithm of limited propositional deduction
• Algorithms for Solving Satisfiability Problems with Qualitative Preferences
• scientific article; zbMATH DE number 991069 (Why is no real title available?)
• Practical algorithms for unsatisfiability proof and core generation in SAT solvers
• Survey propagation: An algorithm for satisfiability

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 Q4209085)