Has There Been Progress on the P vs. NP Question? Scott Aaronson (MIT)
NP-complete Problems and Physical Reality Scott Aaronson Institute for Advanced Study.
NP-complete Problems and Physical Reality Scott Aaronson UC Berkeley IAS.
Has There Been Progress on the P vs. NP Question? Scott Aaronson.
BQP PSPACE NP P PostBQP Limits on Efficient Computation in the Physical World Scott Aaronson MIT.
BQP PSPACE NP P PostBQP Computational Intractability As A Law of Physics Scott Aaronson University of Waterloo.
Quantum Computing and the Limits of the Efficiently Computable Scott Aaronson MIT.
Iterative Rounding and Iterative Relaxation Some of the slides prepared by Lap Chi Lau.
TAM 5.1.'05Boosted Sampling1 Boosted Sampling: Approximation Algorithms for Stochastic Problems Martin Pál Joint work with Anupam Gupta R. RaviAmitabh.
VLSI routing
A.B. Kahng, Ion I. Mandoiu University of California at San Diego, USA A.Z. Zelikovsky Georgia State University, USA Supported in part by MARCO GSRC and.
A sharp threshold for minimum bound-depth/diameter spanning and Steiner trees in random networks Omer Angel Abraham Flaxman David B. Wilson U British Columbia.
