Efficient Verification Of Multiplier And Other Difficult Functions Using IBDDs
- 24 August 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 5.5.1-5.5.5
- https://doi.org/10.1109/cicc.1992.591131
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- IBDDs: an efficient functional representation for digital circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Boolean satisfiability and equivalence checking using general binary decision diagramsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplicationIEEE Transactions on Computers, 1991
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- The complexity of equivalence and containment for free single variable program schemesPublished by Springer Nature ,1978