Skip to main content
Conference Proceedings

Randomized geometric algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1994) 824 LNCS 252-254
DOI: 10.1007/3-540-58218-5_23
0Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Mulmuley, K. (1994). Randomized geometric algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 824 LNCS, pp. 252–254). Springer Verlag. https://doi.org/10.1007/3-540-58218-5_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free