Searching for authors named "David Steurer" – sorted by Relevance.
-
and Problem Complexity—Nonnumerical Algorithms and Problems General Terms
- arora@(email omitted); David Steurer ∗ Princeton University dsteurer@(email omitted); We present
- Add To MetaCart
-
Towards Computing the Grothendieck constant
- Towards Computing the Grothendieck constant Prasad Raghavendra ∗ David Steurer † sup ui,u j∈B (n
- Add To MetaCart
-
Software complexity
- of Karlsruhe and DAVID STEURER Max Planck Institute for Computer Science The edge coloring problem asks
- Cited by 27 (0 self) – Add To MetaCart
-
NSF grants MSPA-MCS 0528414, and ITR 0205594.
- -MCS 0528414, and ITR 0205594. Ishay Haviv ‡ Tel Aviv University 1 David Steurer � Princeton University 1
- Add To MetaCart
-
Rounding Parallel Repetitions of Unique Games
- † Princeton University Oded Regev ¶ Tel Aviv University Ishay Haviv ‡ Tel Aviv University David Steurer
- Cited by 1 (1 self) – Add To MetaCart
-
1. A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover
- , Alexandra Kolla, David Steurer and Nisheeth Vishnoi) To appear in STOC 2008 We present an efficient SDP
- Add To MetaCart

