• DocumentCode
    2784378
  • Title

    Parallel linear programming in fixed dimension almost surely in constant time

  • Author

    Alon, Noga ; Megiddo, Nimrod

  • Author_Institution
    IBM Almaden Res. Center, San Jose, CA, USA
  • fYear
    1990
  • fDate
    22-24 Oct 1990
  • Firstpage
    574
  • Abstract
    It is shown that, for any fixed dimension d, the linear programming problem with n inequality constraints can be solvent on a probabilistic CRCW PRAM (concurrent-read-concurrent-write parallel random-access machine) with O(n) processors almost surely in constant time. The algorithm always finds the correct solution. With nd/log2d processors, the probability that the algorithm will not finish within O(d 2log2d) time tends to zero exponentially with n
  • Keywords
    computational complexity; linear programming; parallel algorithms; computational complexity; constant time; fixed dimension; linear programming problem; probabilistic CRCW PRAM; probability; Failure analysis; Linear matrix inequalities; Linear programming; Phase change random access memory; Time of arrival estimation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on
  • Conference_Location
    St. Louis, MO
  • Print_ISBN
    0-8186-2082-X
  • Type

    conf

  • DOI
    10.1109/FSCS.1990.89578
  • Filename
    89578
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2784378