Computation, Quantum Theory, and You Scott Aaronson, UC Berkeley Qualifying Exam May 13, 2002.
The Polynomial Method In Quantum and Classical Computing Scott Aaronson (MIT) OPEN PROBLEM.
Quantum Lower Bound for the Collision Problem Scott Aaronson 1/10/2002 quant-ph/0111102 I was born at the Big Bang. Cool! We have the same birthday.
The Future (and Past) of Quantum Lower Bounds by Polynomials Scott Aaronson UC Berkeley.
SPEED LIMIT n Quantum Lower Bounds Scott Aaronson (UC Berkeley) August 29, 2002.
The Collision Lower Bound After 12 Years Scott Aaronson (MIT) Lower bound for a collision problem.
Limits on Efficient Computation in the Physical World Dissertation Talk Scott Aaronson.
Lecture 11-cs648-2013 Randomized Algorithms
Lecture 11-cs648-2013
Machine Learning with Discriminative Methods Lecture 02 – PAC Learning and tail bounds intro CS 790-134 Spring 2015 Alex Berg.
1 Assessing the Risk and Return of Financial Trading Systems - a Large Deviation Approach Nicolas NAVET – INRIA, France [email protected] René SCHOTT – IECN,
Lectures prepared by: Elchanan Mossel elena Shvets Introduction to probability Stat 134 FAll 2005 Berkeley Follows Jim Pitman’s book: Probability Section.
