ACM Home Page

Searching within The Guide for: Keywords:"boolean vectors"  (start a new search)

Found 2 of 1,394,228

REFINE YOUR SEARCH

ADVANCED SEARCH
Advanced search.  Advanced Search

FEEDBACK
Please provide us with feedback. Please provide us with feedback

Found 2 of 1,394,228

Results 1 - 2 of 2
Sort by in
1
Hybrid decision diagrams
December 1995
ICCAD '95: Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Publisher: IEEE Computer Society
Full text available: Publisher SitePublisher Site PdfPdf (150.48 KB)
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): 2,   Downloads (12 Months): 11,   Downloads (Overall): 160,    Citation Count: 26

Abstract: Functions that map boolean vectors into the integers are important for the design and verification of arithmetic circuits. MTBDDs and BMDs have been proposed for representing this class of functions. We discuss the relationship between these ...


Keywords: BMDs, MTBDDs, arithmetic circuits verification, binary decision diagrams, boolean vectors, circuit analysis computing, computational complexity, digital arithmetic, hybrid decision diagrams, integers, linear expressions, multi-terminal binary decision diagrams, symbolic model checking algorithms, time complexity
2
Complex Disjunctive Decomposition of Incompletely Specified Boolean Functions
January 1973
IEEE Transactions on Computers , Volume 22 Issue 1
Publisher: IEEE Computer Society
Full text available: Publisher SitePublisher Site
Additional Information:full citation, abstract
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

In this paper the Ashenhurst-Curtis theory of complex disjunctive decompositions is extended to the realm of incompletely specified Boolean functions. A compatibility relation on the column vectors of the decomposition chart is introduced, which is applied ...


Keywords: Complex disjunctive decompositions, constrained Boolean vectors, constrained DON'T CAREs, incompletely specified Boolean functions, simple disjunctive decompositions, vacuous and inessential variables.