Yale Song, Zhen Wen, et al.
IJCAI 2013
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
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
Paula Harder, Venkatesh Ramesh, et al.
EGU 2023
Danila Seliayeu, Quinn Pham, et al.
CASCON 2024