Editing Binary decision diagram (section)

== References ==
{{Reflist|refs=
<ref name="Bryant1986">{{cite journal |first=Randal E. |last=Bryant |title=Graph-Based Algorithms for Boolean Function Manipulation |journal=IEEE Transactions on Computers |volume=C-35 |issue=8 |pages=677–691 |date=August 1986 |doi=10.1109/TC.1986.1676819 |url=https://apps.dtic.mil/sti/pdfs/ADA470446.pdf |citeseerx=10.1.1.476.2952|s2cid=10385726 }}</ref>
<ref name="Lee">{{cite journal |first=C.Y. |last=Lee |title=Representation of Switching Circuits by Binary-Decision Programs |journal=Bell System Technical Journal |volume=38 |issue=4 |pages=985–999 |date=1959 |doi=10.1002/j.1538-7305.1959.tb01585.x |url=}}</ref>
<ref name="Akers">{{cite journal |author1-link=Sheldon B. Akers |first=Sheldon B |last=Akers, Jr. |title=Binary Decision Diagrams |journal=IEEE Transactions on Computers |volume=C-27 |issue=6 |pages=509–516 |date=June 1978 |doi=10.1109/TC.1978.1675141 |s2cid=21028055 |url=}}</ref>
<ref name="Boute_1976">{{cite journal |first=Raymond T. |last=Boute |title=The Binary Decision Machine as a programmable controller |journal=EUROMICRO Newsletter |volume=1 |issue=2 |pages=16–22 |date=January 1976  |doi=10.1016/0303-1268(76)90033-X}}</ref>
<ref name="Bryant-1986">{{cite journal |first=Randal E. |last=Bryant. |title=Graph-Based Algorithms for Boolean Function Manipulation |journal=IEEE Transactions on Computers |volume=C-35 |issue=8 |pages=677–691 |date=1986 |doi=10.1109/TC.1986.1676819 |s2cid=10385726 |url=https://apps.dtic.mil/sti/pdfs/ADA470446.pdf}}</ref>
<ref name="Bryant-1992">{{cite journal |first=Randal E. |last=Bryant |title=Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams |journal=ACM Computing Surveys |volume=24 |issue=3 |pages=293–318 |date=September 1992 |doi=10.1145/136035.136043 |s2cid=1933530 |url=http://www-2.cs.cmu.edu/~bryant/pubs.html}}</ref>
<ref name="Brace">{{cite book |first1=Karl S. |last1=Brace |first2=Richard L. |last2=Rudell |first3=Randal E. |last3=Bryant |chapter=Efficient Implementation of a BDD Package |chapter-url= |title=Proceedings of the 27th ACM/IEEE Design Automation Conference (DAC 1990) |publisher=IEEE Computer Society Press |date=1990 |isbn=978-0-89791-363-8 |pages=40–45 |doi=10.1145/123186.123222}}</ref>
<ref name="Stanford">{{cite web |url=http://scpd.stanford.edu/knuth/index.jsp |title=Stanford Center for Professional Development |website=scpd.stanford.edu |access-date=23 April 2018 |archive-url=https://web.archive.org/web/20140604193847/http://scpd.stanford.edu/knuth/index.jsp |archive-date=4 June 2014 |url-status=dead }}</ref>
<ref name="Jensen">{{cite book |first=R.M. |last=Jensen |chapter-url=https://pure.itu.dk/portal/da/publications/c4ebfd2f-4be9-499e-b44f-4d08f477737a |chapter=CLab: A C++ library for fast backtrack-free interactive product configuration |title=Proceedings of the Tenth International Conference on Principles and Practice of Constraint Programming |series=Lecture Notes in Computer Science |date=2004 |volume=3258 |page=816 |publisher=Springer |isbn=978-3-540-30201-8 |doi=10.1007/978-3-540-30201-8_94}}</ref>
<ref name="Lipmaa">{{cite book |first=H.L. |last=Lipmaa |chapter-url=http://eprint.iacr.org/2009/395.pdf |chapter=First CPIR Protocol with Data-Dependent Computation |title=International Conference on Information Security and Cryptology |series=Lecture Notes in Computer Science |pages=193–210 |date=2009 |volume=5984 |publisher=Springer |isbn=978-3-642-14423-3 |doi=10.1007/978-3-642-14423-3_14}}</ref>
<ref name="Bollig">{{cite journal |first1=Beate |last1=Bollig |first2=Ingo |last2=Wegener |title=Improving the Variable Ordering of OBDDs Is NP-Complete |journal=IEEE Transactions on Computers |volume=45 |issue=9 |pages=993–1002 |date=September 1996 |doi=10.1109/12.537122 |url=}}</ref>
<ref name="Sieling">{{cite journal |first=Detlef |last=Sieling |title=The nonapproximability of OBDD minimization |journal=Information and Computation |volume=172 |issue= 2|pages=103–138 |date=2002 |doi=10.1006/inco.2001.3076 |url=|doi-access=free }}</ref>
<ref name="Rice">{{cite web |author-last=Rice |author-first=Michael |title=A Survey of Static Variable Ordering Heuristics for Efficient BDD/MDD Construction |url=http://alumni.cs.ucr.edu/~skulhari/StaticHeuristics.pdf}}</ref>
<ref name="Woelfel_2005">{{cite journal |first=Philipp |last=Woelfel |title=Bounds on the OBDD-size of integer multiplication via universal hashing |journal=Journal of Computer and System Sciences |volume=71 |issue= 4|pages=520–534 |date=2005 |doi=10.1016/j.jcss.2005.05.004 |url=|doi-access=free |citeseerx=10.1.1.138.6771 }}</ref>
<ref name="Lipton_2009">[[Richard J. Lipton]]. [https://rjlipton.wordpress.com/2009/06/16/bdds-and-factoring/ "BDD's and Factoring"]. ''Gödel's Lost Letter and P=NP'', 2009.</ref>
<ref name="Andersen_1999">{{cite web |author-first=H. R. |author-last=Andersen |url=http://www.cmi.ac.in/~madhavan/courses/verification-2011/andersen-bdd.pdf |title=An Introduction to Binary Decision Diagrams |work=Lecture Notes |date=1999 |publisher=IT University of Copenhagen}}</ref>
<ref name="Huth">{{Cite book |title=Logic in computer science: modelling and reasoning about systems |author-last1=Huth<!-- 1962 --> |author-first1=Michael |date=2004 |publisher=Cambridge University Press |author-last2=Ryan<!-- 1962- --> |author-first2=Mark |isbn=978-0-52154310-1 |edition=2nd |pages=380– |oclc=54960031}}</ref>
<ref name="Somenzi1999">{{cite book |first=Fabio |last=Somenzi |chapter=Binary decision diagrams |chapter-url=http://www.ecs.umass.edu/ece/labs/vlsicad/ece667/reading/somenzi99bdd.pdf |title=Calculational system design |publisher=IOS Press |series=NATO Science Series F: Computer and systems sciences |volume=173 |date=1999 |isbn=978-90-5199-459-9 |pages=303–366 |url=}}</ref>
<ref name="Knuth">{{cite book |author1-link=Donald E. Knuth |first=D.E. |last=Knuth |chapter= |chapter-url= |editor= |title=Fascicle 1: Bitwise tricks & techniques; Binary Decision Diagrams |publisher=Addison–Wesley |series=[[The Art of Computer Programming]] |volume=4 |date=2009 |isbn=978-0-321-58050-4 |pages= |url=}} [http://www-cs-faculty.stanford.edu/~knuth/fasc1b.ps.gz Draft of Fascicle 1b] {{Webarchive|url=https://web.archive.org/web/20160312073634/http://www-cs-faculty.stanford.edu/~knuth/fasc1b.ps.gz |date=2016-03-12  }} available for download</ref>
<ref name="MB88">{{cite book|author1=Jean-Christophe Madre|author2=Jean-Paul Billon|chapter=Proving Circuit Correctness Using Formal Comparison Between Expected and Extracted Behaviour|title=Proceedings of the 25th ACM/IEEE Conference on Design Automation, DAC '88, Anaheim, CA, USA, June 12-15, 1988|date=1988 |pages=205–210 |doi=10.1109/DAC.1988.14759|isbn=0-8186-0864-1 }}</ref>
}}