|
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;
BOOLEAN CIRCUIT MODEL;
MAJORITY FUNCTION;
QUANTUM CIRCUITS;
QUANTUM COMMUNICATION COMPLEXITY;
QUANTUM COMPUTER;
QUANTUM ELECTRONICS;
|
EID: 0027873262
PISSN: 02725428
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (475)
|
References (19)
|