ACM Symposium on Theory of Computing, STOC 2015


Article Details
Title: Randomized Rounding for the Largest Simplex Problem
Article URLs:
Alternative Article URLs:
Authors: Aleksandar Nikolov
  • Microsoft Research Redmond, WA, USA
Sharing: Unknown
Verification: Author has not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/stoc/Nikolov15
Author Comments:

Discuss this paper and its artifacts below