 KL Clarkson. A Las Vegas algorithm for linear programming when the dimension is small. In Proc. 29th Annu. IEEE Sympos. Found. Comput. Sei., pages 452-456, 1988. [21] KL Clarkson and PW Shor. Applications of random sampling in computational geometry,...  Computational Geometry: Algorithms and Applications - Seite 346von Mark de Berg - 2000 - 367 SeitenEingeschränkte Leseprobe - Über dieses Buch
 | Dingzhu Du, Frank Hwang - 1992 - 414 Seiten
...random sampling in computational geometry. Discrete and Computational Geometry, 2:195-222, 1987. 22. KL Clarkson. A Las Vegas algorithm for linear programming when the dimension is small. In Proc. 29th IEEE Symp. on Foundations of Computer Science, pages 452-456, 1988. Revised version: Las Vegas algorithms... | |
 | National Research Council, Division on Engineering and Physical Sciences, Commission on Physical Sciences, Mathematics, and Applications, Panel on Probability and Algorithms - 1992 - 189 Seiten
...<3 o .2 I? 5 o ro > « CO' S £ CD 'i= £ >. JS ' «J 0 CD c ^ CD O -ao -Q 5 => Clarkson, KL (1991), A Las Vegas algorithm for linear programming when the dimension is small, draft manuscript, AT&T Bell Laboratories, November. (Earlier version with same title in Proc. 20th... | |
 | 1993 - 532 Seiten
...programming in O( nx 3d ) time. Information Processing Letters, 22(l):21-24, 1986. [ClaSS] K. Clarkson. Las Vegas algorithm for linear programming when the dimension is small. In Proc. 29. IEEE Symposium on Foundations of Computer Science, pages 452-457, 1988. [DF87] ME Dyer and AM Frieze.... | |
 | Ernst W. Mayr, Claude Puech - 1995 - 698 Seiten
...Computation, pages 427-436, 1983. 7. V. Chvatal. Linear Programming. WH Freeman, New York, NY, 1983. 8. KL Clarkson. A Las Vegas algorithm for linear programming when the dimension is small. In Proc. 29th IEEE Symp. on Foundations of Computer Science, pages 452-456, 1988. 9. DP Dobkin and SP Reiss. The... | |
 | Rajeev Motwani, Prabhakar Raghavan - 1995 - 496 Seiten
...II. In Proceedings of the 4th Annual ACM Symposium on Computational Geometry, pages 1-11, 1988. [104] KL Clarkson. A Las Vegas algorithm for linear programming when the dimension is small. In Proceedings of the 29th Annual IEEE Symposium Foundations of Computer Science, pages 452-456, 1988.... | |
 | 1996 - 608 Seiten
...applications of random sampling in computational geometry. Discrete Comput. Geom., 2:195-222, 1987. [20] KL Clarkson. A Las Vegas algorithm for linear programming when the dimension is small. In Proc. 29th Annu. IEEE Sympos. Found. Comput. Sei., pages 452-456, 1988. [21] KL Clarkson and PW Shor. Applications... | |
 | Jean-Daniel Boissonnat, Mariette Yvinec - 1998 - 548 Seiten
...1989. [66] KL Clarkson. Linear programming in O(n3d ) time. Inf. Proc. Lett., 22:21-24, 1986. [68] KL Clarkson. A Las Vegas algorithm for linear programming when the dimension is small. In Proc. 29th Ann. IEEE Symp. Found. Comp. Sci., 452-456, 1988. [69] KL Clarkson, R. Cole, and RE Tarjan. Randomized... | |
| |
