article

Free access

Parallel linear programming in fixed dimension almost surely in constant time

Authors:

Noga Alon,

Nimrod MegiddoAuthors Info & Claims

Journal of the ACM (JACM), Volume 41, Issue 2

Pages 422 - 434

https://doi.org/10.1145/174652.174661

Published: 01 March 1994 Publication History

PDF eReader

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²d processors, the probability that the algorithm will not finish within O(d²log²d) time tends to zero exponentially with n. —Authors' Abstract

References

[1]

~ALON, N., AND SPENCER, J. H. 1991. The Probabilistic Method. Wiley, New York.

Google Scholar

[2]

~BORODIN, A., VON ZUR GATHEN, J.~ AND HOPCROFT, J. E. 1982. Fast parallel matrix and GCD ~computations, bzf. Control 52, 241 256.

Google Scholar

[3]

~CHER~qOF~, H. 1952. A measure of asymptotic efficiency for tests of hypothesis based on the sum ~of observations. Aml. Math. Star. 23, 493-507.

Google Scholar

[4]

~CLARKSON, K. L. 1986. Linear programming in O(n3~-') time. Inf. Proc. Lett. 22, 21-24.

Crossref

Google Scholar

[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).

Google Scholar

[6]

~DENG, X. An optimal parallel algorithm for linear programming in the plane. Unpublished ~manuscript.

Google Scholar

[7]

~DYER, M. E. 1986. On a multidimensional search technique and its application to the Euclidean ~one-center problem. SlAM J. Comput. 15, 725-738.

Crossref

Google Scholar

[8]

~DYER, M. E., AND FREEZE, A. M. 1989. A randomized algorithm for fixed dimensional linear ~programming. Math. Prog. 44, 203-212.

Crossref

Google Scholar

[9]

~LUEKER, G. S., MEGIDDO, N., AND RAMACHANDRAN, V. 1990. Linear programming with two ~variables per inequality in poly log time. SIAMJ. Comput. 19, 1000-1010.

Crossref

Google Scholar

[10]

~MEGIDDO, N. 1982. Parallel algorithms for finding the maximum and the median almost surely ~in constant-time. Tech. Rep. Graduate School of Industrial Administration, Carnegie-Mellon ~Univ., Pittsburgh, Pa., (Oct.).

Google Scholar

[11]

~MEGIDDO, N. 1984. Linear programming in linear time when the dimension is fixed. J. ACM31, ~114-127.

Crossref

Google Scholar

[12]

~REISCHUK, R. 1981. A fast probabilistic parallel sorting algorithm. In Proceedings of the 22nd ~Annual IEEE 3~Vmpostum on Foundations of Computer Science. IEEE, New York, pp. 212-219.

Google Scholar

[13]

~VALIANT, L. G. 1975. Parallelism in comparison algorithms. SIAMJ. Compttt. 4, 348-355.

Google Scholar

[14]

~WELZL, E. 1988. Partition trees for triangle counting and other range search problems. In ~Proceedings of the 4th Annual ACM Symposiunz oH Computational Geometly (Urbana-Champaign, ~Ill., June 6 8). ACM, New York, pp. 23-33.

Crossref

Google Scholar

Cited By

View all

Atserias AMüller M(2020)Automating Resolution is NP-HardJournal of the ACM10.1145/340947267:5(1-17)Online publication date: 1-Sep-2020
https://dl.acm.org/doi/10.1145/3409472
Blelloch GGu YShun JSun Y(2020)Parallelism in Randomized Incremental AlgorithmsJournal of the ACM10.1145/340281967:5(1-27)Online publication date: 19-Sep-2020
https://dl.acm.org/doi/10.1145/3402819
Canetti R(2020)Universally Composable SecurityJournal of the ACM10.1145/340245767:5(1-94)Online publication date: 16-Sep-2020
https://dl.acm.org/doi/10.1145/3402457
Show More Cited By

Index Terms

Parallel linear programming in fixed dimension almost surely in constant time

Recommendations

Reasoning about knowledge and probability

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 41, Issue 2

March 1994

230 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/174652

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1994

Published in JACM Volume 41, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

18
Total Citations
View Citations
528
Total Downloads

Downloads (Last 12 months)68
Downloads (Last 6 weeks)11

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Atserias AMüller M(2020)Automating Resolution is NP-HardJournal of the ACM10.1145/340947267:5(1-17)Online publication date: 1-Sep-2020
https://dl.acm.org/doi/10.1145/3409472
Blelloch GGu YShun JSun Y(2020)Parallelism in Randomized Incremental AlgorithmsJournal of the ACM10.1145/340281967:5(1-27)Online publication date: 19-Sep-2020
https://dl.acm.org/doi/10.1145/3402819
Canetti R(2020)Universally Composable SecurityJournal of the ACM10.1145/340245767:5(1-94)Online publication date: 16-Sep-2020
https://dl.acm.org/doi/10.1145/3402457
Zhuk D(2020)A Proof of the CSP Dichotomy ConjectureJournal of the ACM10.1145/340202967:5(1-78)Online publication date: 26-Aug-2020
https://dl.acm.org/doi/10.1145/3402029
Blelloch GGu YShun JSun YScheideler CGilbert S(2016)Parallelism in Randomized Incremental AlgorithmsProceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/2935764.2935766(467-478)Online publication date: 11-Jul-2016
https://dl.acm.org/doi/10.1145/2935764.2935766
Long PServedio R(2013)Algorithms and hardness results for parallel large margin learningThe Journal of Machine Learning Research10.5555/2567709.256776014:1(3105-3128)Online publication date: 1-Jan-2013
https://dl.acm.org/doi/10.5555/2567709.2567760
Bogdan PMarculescu RJain S(2013)Dynamic power management for multidomain system-on-chip platformsACM Transactions on Design Automation of Electronic Systems10.1145/250490418:4(1-20)Online publication date: 25-Oct-2013
https://dl.acm.org/doi/10.1145/2504904
Goodrich MSitchinava NZhang Q(2011)Sorting, searching, and simulation in the mapreduce frameworkProceedings of the 22nd international conference on Algorithms and Computation10.1007/978-3-642-25591-5_39(374-383)Online publication date: 5-Dec-2011
https://dl.acm.org/doi/10.1007/978-3-642-25591-5_39
Varma S(2007)Resource constraints on computation and communication in the brainProceedings of the 20th international joint conference on Artifical intelligence10.5555/1625275.1625373(611-616)Online publication date: 6-Jan-2007
https://dl.acm.org/doi/10.5555/1625275.1625373
Just MVarma S(2007)The organization of thinking: What functional brain imaging reveals about the neuroarchitecture of complex cognitionCognitive, Affective, & Behavioral Neuroscience10.3758/CABN.7.3.1537:3(153-191)Online publication date: Sep-2007
https://doi.org/10.3758/CABN.7.3.153
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Reasoning about knowledge and probability

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations