Decomposable structures, Boolean function representations, and optimization

DOI10.1007/3-540-60246-1_110MaRDI QIDQ3568997zbMATH OpenOpenAlexFDO

Authors Stefan Arnborg

Publication date 17 June 2010

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

Full work available at URL https://doi.org/10.1007/3-540-60246-1_110

Mathematics Subject Classification ID

Boolean functions (06E30) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• BDDs -- design, analysis, complexity, and applications.
• Binary decision diagrams
• Graph-Based Algorithms for Boolean Function Manipulation
• scientific article; zbMATH DE number 910734
• On the size of binary decision diagrams representing Boolean functions

Cited in

(4)

• scientific article; zbMATH DE number 69362 (Why is no real title available?)
• scientific article; zbMATH DE number 1796128 (Why is no real title available?)
• Universal Perceptron Theory on Decomposition Structures of n-Bit Boolean Functions
• Boolean Structures

Describes a project that uses

Uses Software

• MONA

This page was built for publication: Decomposable structures, Boolean function representations, and optimization

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