메뉴 건너뛰기





Volumn , Issue , 1997, Pages 2-7

PHDD: An efficient graph representation for floating point circuit verification

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; DATA STRUCTURES; DIGITAL ARITHMETIC; ELECTRIC NETWORK ANALYSIS; ELECTRIC NETWORK SYNTHESIS; GRAPH THEORY; MULTIPLYING CIRCUITS;

EID: 0031378495     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (25)

References (11)
  • Reference 정보가 존재하지 않습니다.

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