[ch11bib001_001] [1] M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., 1979.
[ch11bib001_002] [2] R. B. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers. 35(8):677–691, Aug. 1986.
[ch11bib001_003] [3] R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Proceedings of the International Conference on Computer Aided Design, 1993, pp. 42–47.
[ch11bib001_004] [4] J. C. Madre and J. P. Billion. Proving circuit correctness using formal comparison between expected and extracted behaviour. In Proceedings of the 25th Design Automation Conference, 1988, pp. 205–210.
[ch11bib001_005] [5] J. C. Madre, O. Coudert, ...
Get Customizable Embedded Processors Design Technologies and Applications now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
