Lower bound for the SHORTEST PATH problem

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2000, Pages 14-20

  Mulmuley, Ketan ^a   Shah, Pradyut ^a  

^a UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; MATRIX ALGEBRA; OPTIMIZATION; PARALLEL ALGORITHMS; PROBLEM SOLVING; RANDOM ACCESS STORAGE; THEOREM PROVING;

MATRIX-BASED REPEATED SQUARING ALGORITHMS; PARALLEL RANDOM ACCESS MACHINES (PRAM);

COMPUTATIONAL COMPLEXITY;

EID: 0033682088     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)