A characterization of binary decision diagrams

DOI10.1109/12.204789zbMATH Open1395.68099OpenAlexW2160199654MaRDI QIDQ5375306FDOQ5375306

Sreejit Chakravarty

Publication date: 14 September 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.204789

Mathematics Subject Classification ID

Data structures (68P05)

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On a class of decision diagrams 👍 👎
• Binary decision diagrams in theory and practice 👍 👎
• A rewriting approach to binary decision diagrams 👍 👎
• Comments on "A characterization of binary decision diagrams" 👍 👎
• Binary Decision Diagrams 👍 👎

This page was built for publication: A characterization of binary decision diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375306)