메뉴 건너뛰기





Volumn , Issue , 1993, Pages 352-361

Quantum circuit complexity

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTABILITY AND DECIDABILITY; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; ELECTRIC NETWORK ANALYSIS; INFORMATION THEORY; LOGIC CIRCUITS; MAJORITY LOGIC; MATHEMATICAL MODELS; THEOREM PROVING; TURING MACHINES;

EID: 0027873262     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (475)

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

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