The ROBDD size of simple CNF formulas

DOI10.1007/B93958MaRDI QIDQ5897079zbMATH OpenOpenAlexFDO

Authors Michael Langberg, Amir Pnueli, 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

Mathematics Subject Classification ID

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

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.

Cited in

(4)

• A theoretical and numerical analysis of the worst-case size of reduced ordered binary decision diagrams
• On compiling structured CNFs to OBDDs
• Tools and Algorithms for the Construction and Analysis of Systems
• On compiling structured CNFs to OBDDs

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)