scientific article; zbMATH DE number 7300350
From MaRDI portal
Publication:5146113
Cites work
- scientific article; zbMATH DE number 5139161 (Why is no real title available?)
- scientific article; zbMATH DE number 4085569 (Why is no real title available?)
- scientific article; zbMATH DE number 619541 (Why is no real title available?)
- scientific article; zbMATH DE number 619542 (Why is no real title available?)
- scientific article; zbMATH DE number 682921 (Why is no real title available?)
- scientific article; zbMATH DE number 1150567 (Why is no real title available?)
- scientific article; zbMATH DE number 2087215 (Why is no real title available?)
- scientific article; zbMATH DE number 3799593 (Why is no real title available?)
- scientific article; zbMATH DE number 3325539 (Why is no real title available?)
- scientific article; zbMATH DE number 3339443 (Why is no real title available?)
- scientific article; zbMATH DE number 3353170 (Why is no real title available?)
- scientific article; zbMATH DE number 3031479 (Why is no real title available?)
- A structure-preserving clause form translation
- Classifying the computational complexity of problems
- GRASP: a search algorithm for propositional satisfiability
- Graph-Based Algorithms for Boolean Function Manipulation
- On the complexity of finding the number of solutions of systems of Boolean equations
- Resolution and binary decision diagrams cannot simulate each other polynomially
- SAT-approach to cryptography of some stream ciphering systems
- Short proofs are narrow -- resolution made simple
- The Complexity of Enumeration and Reliability Problems
- The complexity of computing the permanent
- The relative efficiency of propositional proof systems
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 Q5146113)
