The ROBDD size of simple CNF formulas

DOI10.1007/B93958zbMATH Open1179.68137OpenAlexW219731125MaRDI QIDQ5897079FDOQ5897079

Amir Pnueli, Michael Langberg, Yoav Rodeh

Publication date: 5 February 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b93958

Recommendations

• On compiling structured CNFs to OBDDs
• On compiling structured CNFs to OBDDs
• A theoretical and numerical analysis of the worst-case size of reduced ordered binary decision diagrams
• scientific article; zbMATH DE number 1948534
• BDDs -- design, analysis, complexity, and applications.

Mathematics Subject Classification ID

Data structures (68P05) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (2)

• Tools and Algorithms for the Construction and Analysis of Systems
• A Theoretical and Numerical Analysis of the Worst-Case Size of Reduced Ordered Binary Decision Diagrams

This page was built for publication: The ROBDD size of simple CNF formulas

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