Skip to main content
Conference Proceedings

Analysis and manipulation of boolean functions in terms of decision graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1993) 657 LNCS 310-320
DOI: 10.1007/3-540-56402-0_56
4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We investigate the question whether and to what extend the solution of central tasks of digital logic circuit design of a given Boolean function f benefits from a representation of f in terms of certain restricted decision graphs or branching programs.

Cite

CITATION STYLE

APA

Gergov, J., & Meinel, C. (1993). Analysis and manipulation of boolean functions in terms of decision graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 657 LNCS, pp. 310–320). Springer Verlag. https://doi.org/10.1007/3-540-56402-0_56

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