Noga Alon, Nimrod MegiddoAuthors Info & ClaimsIt is shown that for any fixed number of variables, linear-programming problems with $n$ linear inequalities can be solved deterministically by $n$ parallel processors in sublogarithmic time. The parallel time bound (counting only the arithmetic ...
It is shown that, for any fixed dimension d, the linear programming problem with n inequality constraints can be solvent on a probabilistic CRCW PRAM (concurrent-read-concurrent-write parallel random-access machine) with O(n) processors almost surely in ...
We describe a deterministic parallel algorithm for linear programming in fixed dimension d that takes poly(log log n) time in the common concurrent read concurrent write (CRCW) PRAM model and does optimal O(n) work. In the exclusive read exclusive write ...
Andrew Donald Booth
This paper is a rehash of a previous paper by K. L. Clarkson [1], to which the authors have added minor extensions to parallel programming. The authors' abstract gives an adequate description of the contents. Starting with the title, however, the paper is obscure and, in places, illiterate; no attempt seems to have been made to check the proof. There is no adequate description of the algorithm announced in section 3, and no indication of the benefits to be expected if it could be implemented.
Become a reviewer for Computing Reviews.
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in