Susan L. Spraragen
International Conference on Design and Emotion 2010
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
Shashank Ahire, Melissa Guyre, et al.
CUI 2025
Dorit S. Hochbaum, Nimrod Megiddo, et al.
Mathematical Programming
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence