Testing geometric convexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3328, Issue , 2004, Pages 469-480

  Rademacher, Luis ^a   Vempala, Santosh ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; SET THEORY; SOFTWARE ENGINEERING;

2 - DIMENSIONAL; COMPUTATION TIME; CONVEX SET; EXPONENTIALS; HIGH PROBABILITY; LOW BOUND; POLYNOMIAL COMPLEXITY; RANDOM ORACLE; SIMPLE++; SYMMETRIC DIFFERENCE; LOWER BOUNDS;

SET THEORY; COMPUTATIONAL COMPLEXITY;

EID: 35048866496     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30538-5_39     Document Type: Article

References (8)

1. Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. J. ACM 45 (1998) 653-750
2. Parnas, M., Ron, D., Rubinfeld, R.: On testing convexity and submodularity. SIAM J. Comput. 32 (2003) 1158-1184 (electronic)
3. Lovász, L., Vempala, S.: Hit-and-run from a corner. In: STOC '04. ACM, New York (2004)
4. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press (1995)
5. Groemer, H.: On the mean value of the volume of a random polytope in a convex set. Arch. Math. (Basel) 25 (1974) 86-90
6. Bárány, I., Buchta, C.: Random polytopes in a convex polytope, independence of shape, and concentration of vertices. Math. Ann. 297 (1993) 467-497
7. Bárány, I., Füredi, Z.: Computing the volume is difficult. Discrete Comput. Geom. 2 (1987) 319-326
8. Rockafellar, R.T., Wets, R.J.: Variational Analysis. Number 317 in Grundlehren der mathematischen Wissenschaften. Springer-Verlag (1998)