Exponential separation of quantum and classical communication complexity

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1999, Pages 358-367

  Raz, Ran ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; MATRIX ALGEBRA; PROBABILITY; PROBLEM SOLVING; QUANTUM THEORY;

COMMUNICATION COMPLEXITY; EXPONENTIAL SEPARATION;

COMPUTATIONAL COMPLEXITY;

EID: 0032629110     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/301250.301343     Document Type: Article

References (22)