scientific article; zbMATH DE number 7300350

MaRDI QIDQ5146113

No author found.

Publication date: 25 January 2021

Full work available at URL: http://mathnet.ru/eng/pdm158

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

NP-completenesspropositional proof systemslogical equationstseitin transformations

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites Work

• The complexity of computing the permanent
• A structure-preserving clause form translation
• Resolution and binary decision diagrams cannot simulate each other polynomially
• Short proofs are narrow—resolution made simple
• Graph-Based Algorithms for Boolean Function Manipulation
• Classifying the computational complexity of problems
• The Complexity of Enumeration and Reliability Problems
• The relative efficiency of propositional proof systems
• GRASP: a search algorithm for propositional satisfiability
• On the complexity of finding the number of solutions of systems of Boolean equations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item