Parallel linear programming in fixed dimension almost surely in constant time-Reference-Cited by-同舟云学术

Parallel linear programming in fixed dimension almost surely in constant time

Published:1994-03 Issue:2 Volume:41 Page:422-434
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Alon Noga¹,Megiddo Nimrod¹

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)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/174652.174661

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 × 3d2) 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 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parallelism in Randomized Incremental Algorithms;Journal of the ACM;2020-10-16

2. Parallelism in Randomized Incremental Algorithms;Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures;2016-07-11

3. Dynamic power management for multidomain system-on-chip platforms;ACM Transactions on Design Automation of Electronic Systems;2013-10

4. Sorting, Searching, and Simulation in the MapReduce Framework;Algorithms and Computation;2011

5. The organization of thinking: What functional brain imaging reveals about the neuroarchitecture of complex cognition;Cognitive, Affective, & Behavioral Neuroscience;2007-09