Affiliation:
1. IBM Almaden Research Center, San Jose, CA; and Tel Aviv Univ., Tel Aviv, Israel
Abstract
For any fixed dimension
d
, the linear programming problem with
n
inequality constraints can be solved on a probabilistic CRCW PRAM with
O
(
n
) processors almost surely in constant time. The algorithm always finds the correct solution. With
nd
/log
2
d
processors, the probability that the algorithm will not finish within
O
(
d
2
log
2
d
) time tends to zero exponentially with
n
. —
Authors' Abstract
Publisher
Association for Computing Machinery (ACM)
Reference13 articles.
1. ~ALON , N. , AND SPENCER , J. H. 1991. The Probabilistic Method . Wiley , New York . ~ALON, N., AND SPENCER, J. H. 1991. The Probabilistic Method. Wiley, New York.
2. Fast parallel matrix and GCD ~computations, bzf;~BORODIN A.;Control,1982
3. A measure of asymptotic efficiency for tests of hypothesis based on the sum ~of observations;~CHER~ OF~;Aml. Math. Star.,1952
4. Linear programming in O(n × 3d) time
5. ~CLARKSON K. L. 1988. Las Vegas algorithms for linear and integer programming when the ~dimension is small. Unpublished manuscript. (A preliminary version appeared in Proceedings of ~the 29th Alznual IEEE Symposium on Foundations of Computer Science. IEEE New York pp. ~452 456). ~CLARKSON K. L. 1988. Las Vegas algorithms for linear and integer programming when the ~dimension is small. Unpublished manuscript. (A preliminary version appeared in Proceedings of ~the 29th Alznual IEEE Symposium on Foundations of Computer Science. IEEE New York pp. ~452 456).
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献