Dualization of Boolean functions using ternary decision diagrams
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5852793 (Why is no real title available?)
- scientific article; zbMATH DE number 2044509 (Why is no real title available?)
- scientific article; zbMATH DE number 846270 (Why is no real title available?)
- A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis
- Branching Programs and Binary Decision Diagrams
- Computational aspects of monotone dualization: a brief survey
- Conflict-Driven Answer Set Enumeration
- Directed hypergraphs and applications
- Efficient algorithms for dualizing large-scale hypergraphs
- Graph-Based Algorithms for Boolean Function Manipulation
- TG-Pro: A SAT-based ATPG system
- The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
- Zero-suppressed BDDs and their applications
Cited in
(3)
This page was built for publication: Dualization of Boolean functions using ternary decision diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q513353)