Implicit and incremental computation of primes and essential primes of Boolean functions
- 2 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Symbolic prime generation for multiple-valued functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Efficient implementation of a BDD packagePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A unified framework for the formal verification of sequential circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Absolute minimization of completely specified switching functionsIEEE Transactions on Computers, 1991
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Logic Minimization Algorithms for VLSI SynthesisPublished by Springer Nature ,1984