Cite
HARVARD Citation
Eldan, R. et al. (2018). Efficient algorithms for discrepancy minimization in convex sets. Random structures & algorithms. 53 (2), pp. 289-307. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Eldan, R. et al. (2018). Efficient algorithms for discrepancy minimization in convex sets. Random structures & algorithms. 53 (2), pp. 289-307. [Online].