|
Volumn , Issue , 2001, Pages 610-617
|
Efficient canonical form for Boolean matching of complex functions in large libraries
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
COMPUTATIONAL COMPLEXITY;
DIGITAL LIBRARIES;
LOGIC GATES;
BOOLEAN MATCHING;
BOOLEAN FUNCTIONS;
|
EID: 0035213068
PISSN: 10923152
EISSN: None
Source Type: Journal
DOI: 10.1109/ICCAD.2001.968724 Document Type: Article |
Times cited : (3)
|
References (11)
|