scientific article; zbMATH DE number 4023248

MaRDI QIDQ3765752zbMATH OpenFDO

Authors Max Kanovich

Publication date 1987

zbMATH Keywords

derivability of formulasimplicative normal formspolynomial complexityquasipolynomial algorithmssatisfiability of propositional formulas

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The complexity of satisfiability problems
• A satisfiability tester for non-clausal propositional calculus
• scientific article; zbMATH DE number 1222558
• scientific article; zbMATH DE number 4039349
• scientific article; zbMATH DE number 4085614

Cited in

(5)

• Recognition of tractable satisfiability problems through balanced polynomial representations
• Polynomial algorithm of limited propositional deduction
• A Splitting Algorithm Based on Soft Constraints for the Computation of Truth Degree in Quantitative Logic
• Efficient program synthesis: semantics, logic, complexity
• Formal correctness of a quadratic unification algorithm

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