|
Volumn Part F129585, Issue , 1993, Pages 11-20
|
Quantum complexity theory
|
Author keywords
[No Author keywords available]
|
Indexed keywords
COMPUTATIONAL COMPLEXITY;
CONSTRAINT THEORY;
EQUIVALENCE CLASSES;
FINITE AUTOMATA;
MATHEMATICAL MODELS;
PROBABILISTIC LOGICS;
QUANTUM THEORY;
RANDOM PROCESSES;
STATE ASSIGNMENT;
TURING MACHINES;
CHURCH TURING THESIS;
COMPUTABILITY THEORY;
QUANTUM COMPLEXITY THEORY;
COMPUTATION THEORY;
|
EID: 0027245270
PISSN: 07378017
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1145/167088.167097 Document Type: Conference Paper |
Times cited : (389)
|
References (10)
|