Decomposition representations of logical equations in problems of inversion of discrete functions
From MaRDI portal
(Redirected from Publication:404200)
Recommendations
Cites work
- A machine program for theorem-proving
- BerkMin: A fast and robust SAT-solver
- Classifying the computational complexity of problems
- Graph-Based Algorithms for Boolean Function Manipulation
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1150567 (Why is no real title available?)
- scientific article; zbMATH DE number 194333 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- Resolution and binary decision diagrams cannot simulate each other polynomially
- The Complexity of Enumeration and Reliability Problems
Cited in
(11)- Spectral methods in logical data analysis
- Transformations of discrete functions calculation algorithms to Boolean equations
- Algebraic decomposition of discrete functions
- DPLL+ROBDD derivation applied to inversion of some cryptographic functions
- scientific article; zbMATH DE number 5847329 (Why is no real title available?)
- scientific article; zbMATH DE number 3852960 (Why is no real title available?)
- scientific article; zbMATH DE number 7003195 (Why is no real title available?)
- scientific article; zbMATH DE number 219946 (Why is no real title available?)
- Using merging variables-based local search to solve special variants of MaxSAT problem
- Composition of inverse problems with a given logical structure
- Finding Effective SAT Partitionings Via Black-Box Optimization
This page was built for publication: Decomposition representations of logical equations in problems of inversion of discrete functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404200)