Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time
暂无分享,去创建一个
[1] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[2] Xiaotie Deng. An Optimal Parallel Algorithm for Linear Programming in the Plane , 1990, Inf. Process. Lett..
[3] Martin E. Dyer,et al. A randomized algorithm for fixed-dimensional linear programming , 1989, Math. Program..
[4] Kenneth L. Clarkson,et al. A Las Vegas algorithm for linear programming when the dimension is small , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[5] Emo Welzl,et al. Partition trees for triangle counting and other range searching problems , 1988, SCG '88.
[6] Nimrod Megiddo,et al. Linear programming with two variables per inequality in poly-log time , 1986, STOC '86.
[7] Martin E. Dyer,et al. On a Multidimensional Search Technique and its Application to the Euclidean One-Centre Problem , 1986, SIAM J. Comput..
[8] Nimrod Megiddo,et al. Linear Programming in Linear Time When the Dimension Is Fixed , 1984, JACM.
[9] Allan Borodin,et al. Fast parallel matrix and GCD computations , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[10] Rüdiger Reischuk,et al. A fast probabilistic parallel sorting algorithm , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[11] Leslie G. Valiant,et al. Parallelism in Comparison Problems , 1975, SIAM J. Comput..
[12] H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .