Art
J-GLOBAL ID:200902033457397809   Reference number:91A0305221

On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication.

整数乗算への応用を目的としたブール関数のグラフ表現とVLSI実現の複雑さ
Author (1):
Material:
Volume: 40  Issue:Page: 205-213  Publication year: Feb. 1991 
JST Material Number: C0233A  ISSN: 0018-9340  CODEN: ICTOB4  Document type: Article
Article type: 原著論文  Country of issue: United States (USA)  Language: ENGLISH (EN)
Thesaurus term:
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
,...
Semi thesaurus term:
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
,...
   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=91A0305221&from=J-GLOBAL&jstjournalNo=C0233A") }}
JST classification (1):
JST classification
Category name(code) classified by JST.
Theory of computation 

Return to Previous Page