scientific article; zbMATH DE number 7300350
From MaRDI portal
Publication:5146113
Authors:
Publication date: 25 January 2021
Full work available at URL: http://mathnet.ru/eng/pdm158
Title of this publication is not available (Why is that?)
Cites Work
- Graph-Based Algorithms for Boolean Function Manipulation
- A structure-preserving clause form translation
- Title not available (Why is that?)
- The complexity of computing the permanent
- The Complexity of Enumeration and Reliability Problems
- Title not available (Why is that?)
- GRASP: a search algorithm for propositional satisfiability
- Title not available (Why is that?)
- The relative efficiency of propositional proof systems
- Short proofs are narrow -- resolution made simple
- Title not available (Why is that?)
- Resolution and binary decision diagrams cannot simulate each other polynomially
- Classifying the computational complexity of problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the complexity of finding the number of solutions of systems of Boolean equations
- Title not available (Why is that?)
- SAT-approach to cryptography of some stream ciphering systems
- Title not available (Why is that?)
Cited In (1)
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)