Project Scheduling in And-Or Graphs: A Generalization of Dijkstra's Algorithm George M. Adelson-Velsky and Eugene Levner Mathematics of Operations Research , pp. 504-517 (14 pages) ...

This paper considers factoring integers and finding discrete logarithms, two problems that are generally thought to be hard on classical computers and that have been used as the basis of several ...