Documents Lower Bounds for Local Search by Quantum Arguments Scott Aaronson (UC Berkeley) aaronson August 14,....

Slide 1Lower Bounds for Local Search by Quantum Arguments Scott Aaronson (UC Berkeley) http://www.cs.berkeley.edu/~aaronson August 14, 2003 Slide 2 Quantum Background Needed…

Documents Mergesort, Analysis of Algorithms Jon von Neumann and ENIAC (1945)

Slide 1 Mergesort, Analysis of Algorithms Jon von Neumann and ENIAC (1945) Slide 2 2 Why Does It Matter? 1000 Time to solve a problem of size 10,000 100,000 million 10 million…

Documents Mergesort, Analysis of Algorithms

Mergesort, Analysis of Algorithms Jon von Neumann and ENIAC (1945) Why Does It Matter? 1000 Time to solve a problem of size 10,000 100,000 million 10 million 1.3 seconds…

Documents Cakes, Pies, and Fair Division

Cakes, Pies, and Fair Division Walter Stromquist Swarthmore College [email protected] Rutgers Experimental Mathematics Seminar October 4, 2007 10/4/2007 * Cakes,…