{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T20:40:02Z","timestamp":1740948002827,"version":"3.38.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,2,19]],"date-time":"2011-02-19T00:00:00Z","timestamp":1298073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s00454-011-9328-x","type":"journal-article","created":{"date-parts":[[2011,2,18]],"date-time":"2011-02-18T20:31:23Z","timestamp":1298061083000},"page":"29-47","source":"Crossref","is-referenced-by-count":2,"title":["A Polynomial Number of Random Points Does\u00a0Not\u00a0Determine the Volume of a Convex Body"],"prefix":"10.1007","volume":"46","author":[{"given":"Ronen","family":"Eldan","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,2,19]]},"reference":[{"key":"9328_CR1","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF02187886","volume":"2","author":"I. B\u00e1r\u00e1ny","year":"1987","unstructured":"B\u00e1r\u00e1ny, I., F\u00fcredi, Z.: Computing the volume is difficult. Discrete Comput. Geom. 2, 319\u2013326 (1987)","journal-title":"Discrete Comput. Geom."},{"key":"9328_CR2","series-title":"Flavors of Geometry","volume-title":"Volume Estimates and Rapid Mixing","author":"B. Bollob\u00e1s","year":"1997","unstructured":"Bollob\u00e1s, B.: Volume Estimates and Rapid Mixing. Flavors of Geometry, vol.\u00a031. MSRI Publications, Berkeley (1997)"},{"issue":"1","key":"9328_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/102782.102783","volume":"38","author":"M.E. Dyer","year":"1991","unstructured":"Dyer, M.E., Frieze, A.M., Kannan, R.: A random polynomial time algorithm for approximating the volume of convex bodies. J. ACM 38(1), 1\u201317 (1991)","journal-title":"J. ACM"},{"key":"9328_CR4","unstructured":"Goyal, N., Rademacher, L.: Learning convex bodies is hard (submitted manuscript, 2008). doi: 10.1.1.162.3154"},{"key":"9328_CR5","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/j.jfa.2006.12.005","volume":"245","author":"B. Klartag","year":"2007","unstructured":"Klartag, B.: Power-law estimates for the central limit theorem for convex sets. J. Funct. Anal. 245, 284\u2013310 (2007)","journal-title":"J. Funct. Anal."},{"key":"9328_CR6","volume-title":"Proc. 49th IEEE Symposium on Foundations of Computer Science","author":"A.R. Klivans","year":"2008","unstructured":"Klivans, A.R., O\u2019Donnell, R., Servedio, R.A.: Learning geometric concepts via Gaussian surface area. In: Proc. 49th IEEE Symposium on Foundations of Computer Science (2008)"},{"key":"9328_CR7","unstructured":"Lov\u00e1sz, L.: Private communication"},{"key":"9328_CR8","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1002\/rsa.3240040402","volume":"4","author":"L. Lov\u00e1sz","year":"1993","unstructured":"Lov\u00e1sz, L., Simonovits, M.: Random walks in a convex body and an improved volume algorithm. Random Struct. Algorithms 4, 359\u2013412 (1993)","journal-title":"Random Struct. Algorithms"},{"key":"9328_CR9","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L., Vempala, S.: Simulated annealing in convex bodies and an 0\u2217(n 4) volume algorithm. FOCS 650\u2013672 (2003)","DOI":"10.1109\/SFCS.2003.1238237"},{"key":"9328_CR10","volume-title":"Proc. 47th IEEE Symposium on Foundations of Computer Science","author":"L. Rademacher","year":"2006","unstructured":"Rademacher, L., Vempala, S.: Dispersion of mass and the complexity of randomized geometric algorithms. In: Proc. 47th IEEE Symposium on Foundations of Computer Science (2006)"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-011-9328-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-011-9328-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-011-9328-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T20:00:53Z","timestamp":1740945653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-011-9328-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,19]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["9328"],"URL":"https:\/\/doi.org\/10.1007\/s00454-011-9328-x","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2011,2,19]]}}}