Measure of formulas: Calculation and a polynomial class for satisfiability

MaRDI QIDQ1422755zbMATH OpenFDO

Authors G. V. Davydov, I. M. Davydova

Publication date 25 February 2004

Published in Vestnik St. Petersburg University. Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• An algorithm for the satisfiability problem of formulas in conjunctive normal form
• scientific article; zbMATH DE number 1678383
• scientific article; zbMATH DE number 2177624
• scientific article; zbMATH DE number 4039349
• A perspective on certain polynomial-time solvable classes of satisfiability

Cited in

(3)

• scientific article; zbMATH DE number 1678383 (Why is no real title available?)
• scientific article; zbMATH DE number 2177624 (Why is no real title available?)
• Towards logical operations research -- propositional case

This page was built for publication: Measure of formulas: Calculation and a polynomial class for satisfiability

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