On a class of decision diagrams
DOI10.1134/S000511791604007XzbMATH Open1409.94951OpenAlexW2345805936MaRDI QIDQ329079FDOQ329079
Authors: Aleksandr Anatol'evich Semënov, Il'ya Vladimirovich Otpushchennikov 
Publication date: 21 October 2016
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s000511791604007x
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorics in computer science (68R05) Combinatorial codes (94B25)
Cites Work
- Theory and Applications of Satisfiability Testing
- Technology for translating combinatorial problems into Boolean equations
- Graph-Based Algorithms for Boolean Function Manipulation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- GRASP: a search algorithm for propositional satisfiability
- DPLL+ROBDD derivation applied to inversion of some cryptographic functions
- Title not available (Why is that?)
Cited In (7)
- Unified View of Decision Diagrams for Representation of Discrete Functions
- A characterization of binary decision diagrams
- Title not available (Why is that?)
- Symbolic reasoning with weighted and normalized decision diagrams
- Hierarchical Set Decision Diagrams and Automatic Saturation
- Superset Generation on Decision Diagrams
- On CNF encodings of decision diagrams
Uses Software
This page was built for publication: On a class of decision diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q329079)
