×
Log in
Upload File
Most Popular
Study
Business
Design
Technology
Travel
Explore all categories
The top documents tagged [minimum steiner tree]
Has There Been Progress on the P vs. NP Question? Scott Aaronson (MIT)
227 views
NP-complete Problems and Physical Reality Scott Aaronson Institute for Advanced Study
217 views
Quantum Computing and the Limits of the Efficiently Computable Scott Aaronson MIT
219 views
NP-complete Problems and Physical Reality Scott Aaronson UC Berkeley IAS
221 views
Has There Been Progress on the P vs. NP Question? Scott Aaronson
219 views
BQP PSPACE NP P PostBQP Limits on Efficient Computation in the Physical World Scott Aaronson MIT
223 views
BQP PSPACE NP P PostBQP Computational Intractability As A Law of Physics Scott Aaronson University of Waterloo
216 views
Iterative Rounding and Iterative Relaxation Some of the slides prepared by Lap Chi Lau
215 views
TAM 5.1.'05Boosted Sampling1 Boosted Sampling: Approximation Algorithms for Stochastic Problems Martin Pál Joint work with Anupam Gupta R. RaviAmitabh
216 views
VLSI routing
5.725 views
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
212 views
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
213 views
Next >