Skip to main content
Conference Proceedings

Decomposable structures, boolean function representations, and optimization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1995) 969 21-36
DOI: 10.1007/3-540-60246-1_110
0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show the connection between the theory of bounded treewidth graphs, monadic second order definable structures and sets, and boolean decision diagrams. We survey recent results in algorithms for bounded treewidth, symbolic model checking and representation schemes for Boolean functions. Some practical applications are indicated.

Cite

CITATION STYLE

APA

Arnborg, S. (1995). Decomposable structures, boolean function representations, and optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 969, pp. 21–36). Springer Verlag. https://doi.org/10.1007/3-540-60246-1_110

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free