Decomposition representations of logical equations in problems of inversion of discrete functions
From MaRDI portal
Publication:404200
DOI10.1134/S1064230709050062zbMath1294.90057OpenAlexW2007591820MaRDI QIDQ404200
Aleksandr Anatol'evich Semënov
Publication date: 4 September 2014
Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1064230709050062
Related Items
Finding Effective SAT Partitionings Via Black-Box Optimization ⋮ Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem
Uses Software
Cites Work
- Resolution and binary decision diagrams cannot simulate each other polynomially
- BerkMin: A fast and robust SAT-solver
- Graph-Based Algorithms for Boolean Function Manipulation
- Classifying the computational complexity of problems
- The Complexity of Enumeration and Reliability Problems
- A machine program for theorem-proving
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item