Decomposition representations of logical equations in problems of inversion of discrete functions
From MaRDI portal
Publication:404200
DOI10.1134/S1064230709050062zbMATH Open1294.90057OpenAlexW2007591820MaRDI QIDQ404200FDOQ404200
Authors: 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
Recommendations
Cites Work
- BerkMin: A fast and robust SAT-solver
- Graph-Based Algorithms for Boolean Function Manipulation
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Complexity of Enumeration and Reliability Problems
- Title not available (Why is that?)
- A machine program for theorem-proving
- Resolution and binary decision diagrams cannot simulate each other polynomially
- Classifying the computational complexity of problems
- Title not available (Why is that?)
Cited In (11)
- Title not available (Why is that?)
- Using merging variables-based local search to solve special variants of MaxSAT problem
- Title not available (Why is that?)
- Algebraic decomposition of discrete functions
- Finding Effective SAT Partitionings Via Black-Box Optimization
- Composition of inverse problems with a given logical structure
- Spectral methods in logical data analysis
- Title not available (Why is that?)
- Transformations of discrete functions calculation algorithms to Boolean equations
- Title not available (Why is that?)
- DPLL+ROBDD derivation applied to inversion of some cryptographic functions
Uses Software
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)
