scientific article; zbMATH DE number 4023248

zbMATH Open0629.03013MaRDI QIDQ3765752FDOQ3765752

Authors: Max Kanovich 

Publication date: 1987

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

polynomial complexityderivability of formulasimplicative normal formsquasipolynomial algorithmssatisfiability of propositional formulas

Mathematics Subject Classification ID

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

Cited In (5)

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

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)