John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
Conference paper
Risks and potentials of using EMV for internet payments
Els van Herreweghen, Uta Wille
USENIX Workshop on Smartcard Technology 1999
Susan L. Spraragen
International Conference on Design and Emotion 2010
P. Trespeuch, Y. Fournier, et al.
Civil-Comp Proceedings