• DocumentCode
    2237031
  • Title

    A lower bound for the shortest path problem

  • Author

    Mulmuley, Ketan ; Shah, Pradyut

  • Author_Institution
    Dept. of Comput. Sci., Chicago Univ., IL, USA
  • fYear
    2000
  • fDate
    2000
  • Firstpage
    14
  • Lastpage
    21
  • Abstract
    We show that the shortest path problem cannot be solved in o(log n) time on an unbounded fan-in PRAM without bit operations using poly(n) processors even when the bit-lengths of the weights on the edges are restricted to be of size O(log3 n). This shows that the matrix-based repeated squaring algorithm for the shortest path problem is optimal in the unbounded fan-in PRAM model without bit operations
  • Keywords
    computational complexity; computational geometry; parallel algorithms; fan-in PRAM; lower bound; matrix-based repeated squaring algorithm; shortest path problem; Arithmetic; Circuits; Computational modeling; Computer science; Costs; Parallel algorithms; Phase change random access memory; Polynomials; Registers; Shortest path problem;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Complexity, 2000. Proceedings. 15th Annual IEEE Conference on
  • Conference_Location
    Florence
  • ISSN
    1093-0159
  • Print_ISBN
    0-7695-0674-7
  • Type

    conf

  • DOI
    10.1109/CCC.2000.856731
  • Filename
    856731
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2237031