Thumbnail
Access Restriction
Subscribed

Author Alon, Noga ♦ Megiddo, Nimrod
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1994
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Computational geometry ♦ Linear programming ♦ Multidimensional search ♦ Parallel computation ♦ Probabilistic computation
Abstract For any fixed dimension <?Pub Fmt italic>d<?Pub Fmt /italic>, thelinear programming problem with <?Pub Fmt italic>n<?Pub Fmt /italic>inequality constraints can be solved on a probabilistic CRCW PRAM with<?Pub Fmt italic>O<?Pub Fmt /italic>(<?Pub Fmt italic>n<?Pub Fmt /italic>)processors almost surely in constant time. The algorithm always findsthe correct solution. With<?Pub Fmt italic>nd<?Pub Fmt /italic>/log2<?Pub Fmt italic>d<?Pub Fmt /italic>processors, the probability that the algorithm will not finish within<?Pub Fmt italic>O<?Pub Fmt /italic>(<?Pub Fmt italic>d<?Pub Fmt /italic>2log2<?Pub Fmt italic>d<?Pub Fmt /italic>time tends to zero exponentially with<?Pub Fmt italic>n<?Pub Fmt /italic>.—<?Pub Fmt italic><?Pub Caret>Authors' Abstract<?Pub Fmt /italic>
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1994-03-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 41
Issue Number 2
Page Count 13
Starting Page 422
Ending Page 434


Open content in new tab

   Open content in new tab
Source: ACM Digital Library