Bemali Wickramanayake, Zhipeng He, et al.
Knowledge-Based Systems
Paper
Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time
Abstract
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.
Related
Rama Akkiraju, Pinar Keskinocak, et al.
Applied Intelligence
Yi Zhou, Parikshit Ram, et al.
ICLR 2023
Conference paper
Counterexample to theorems of Cox and Fine
Joseph Y. Halpern
aaai 1996