Art
J-GLOBAL ID：200902178445480431   Reference number：94A0071132

Quantum Circuit Complexity.

量子回路計算量
Author (1)：
YAO A C-C

About YAO A C-C

(Princeton Univ., New Jersey)

About Princeton Univ., New Jersey


Material：
Annual Symposium on Foundations of Computer Science  (Annu Symp Found Comput Sci)

About Annual Symposium on Foundations of Computer Science


Volume： 34th  Page： 352-361  Publication year： 1993 
JST Material Number： D0710A  ISSN： 0272-5428  Document type： Proceedings
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.
logic circuit

About logic circuit

,...
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.
computational complexity

About computational complexity


   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=94A0071132&from=J-GLOBAL&jstjournalNo=D0710A") }}
JST classification (1)：
JST classification
Category name(code) classified by JST.
Theory of computation 
(JB02000A)

About Theory of computation

Terms in the title (2)：
Terms in the title
Keywords automatically extracted from the title.
量子

About 量子

, 
回路計算量

About 回路計算量


Return to Previous Page

TOP

BOTTOM