메뉴 건너뛰기




Volumn 20, Issue 3, 2002, Pages 311-326

On WLCDs and the complexity of word-level decision diagrams - A lower bound for division

Author keywords

Decision diagrams; Division; Formal verification; Functional design verification; WLCDs; Word level decision diagrams

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; DECISION THEORY; POLYNOMIALS;

EID: 0036570073     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1014702331828     Document Type: Article
Times cited : (4)

References (18)
  • 4
    • 0026107125 scopus 로고
    • On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
    • (1991) IEEE Trans. on Comp. , vol.40 , pp. 205-213
    • Bryant, R.E.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.