Exact ordered binary decision diagram size when representing classes of symmetric functions
- 1 August 1991
- journal article
- Published by Springer Nature in Journal of Electronic Testing
- Vol. 2 (3) , 243-259
- https://doi.org/10.1007/bf00135441
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplicationIEEE Transactions on Computers, 1991
- The influences of fault type and topology on fault model performance and the implications to test and testable designPublished by Association for Computing Machinery (ACM) ,1990
- Efficient implementation of a BDD packagePublished by Association for Computing Machinery (ACM) ,1990
- Test pattern generation for sequential MOS circuits by symbolic fault simulationPublished by Association for Computing Machinery (ACM) ,1989
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Functional Test Generation for Digital Circuits Described Using Binary Decision DiagramsIEEE Transactions on Computers, 1986
- Simulation of MOS Circuits by Decision DiagramsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
- Synthesis of Minimal Binary Decision TreesIEEE Transactions on Computers, 1979
- Binary Decision DiagramsIEEE Transactions on Computers, 1978
- A Basis for a Mathematical Theory of Computation)Published by Elsevier ,1963