Algorithms
Computation, Quantum Theory, and You Scott Aaronson, UC Berkeley Qualifying Exam May 13, 2002.
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.
Oracles Are Subtle But Not Malicious Scott Aaronson University of Waterloo.
QMA/qpoly PSPACE/poly: De-Merlinizing Quantum Protocols Scott Aaronson University of Waterloo.
Grade School Revisited: How To Multiply Two Numbers Great Theoretical Ideas In Computer Science Anupam Gupta Danny Sleator CS 15-251 Fall 2010 Lecture.
20110319 parameterized algorithms_fomin_lecture01-02
Two Query PCP with Subconstant Error Dana Moshkovitz Princeton University and The Institute for Advanced Study Ran Raz The Weizmann Institute 1.
1 Chapter 34: NP-Completeness. 2 About this Tutorial What is NP ? How to check if a problem is in NP ? Cook-Levin Theorem Showing one of the most difficult.
CP - 2001 1 Formal Models of Heavy-Tailed Behavior in Combinatorial Search Hubie Chen, Carla P. Gomes, and Bart Selman {hubes,gomes,selman}@cs.cornell.edu.
Introduction to Algorithm Instructor: Dr. Bin Fu Office: ENGR 3. 280 (Third Floor) Email: [email protected]@utpa.edu Textbook: Introduction to Algorithm.
