Nimrod Megiddo
Mathematical Programming
For any fixed dimension d, thelinear programming problem with ninequality constraints can be solved on a probabilistic CRCW PRAM withO1994processors almost surely in constant time. The algorithm always findsthe correct solution. Withnd/log2dprocessors, the probability that the algorithm will not finish withinO(d2log2dtime tends to zero exponentially withn. © 1994, ACM. All rights reserved.
Nimrod Megiddo
Mathematical Programming
Ira Pohl
Artificial Intelligence
Victor Akinwande, Megan Macgregor, et al.
IJCAI 2024
Fahiem Bacchus, Joseph Y. Halpern, et al.
IJCAI 1995