Related references
Note: Only part of the references are listed.
Proceedings Paper
Computer Science, Theory & Methods
Forrelation: A Problem that Optimally Separates Quantum from Classical Computing
Scott Aaronson et al.
STOC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON THEORY OF COMPUTING (2015)
Article
Computer Science, Theory & Methods
Complexity measures and decision tree complexity: a survey
H Buhrman et al.
THEORETICAL COMPUTER SCIENCE (2002)
Article
Computer Science, Hardware & Architecture
Quantum lower bounds by polynomials
R Beals et al.
JOURNAL OF THE ACM (2001)
Share Paper
