Date: 2015-05-29 10:12:12Computational complexity theory Analysis of algorithms Theory of computation Mathematics Edsger W. Dijkstra Algorithm Mathematical logic Theoretical computer science Time complexity Shortest path problem Asymptotically optimal algorithm Randomized algorithm | | Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication∗ Christoph Lenzen Nancy LynchAdd to Reading ListSource URL: people.mpi-inf.mpg.deDownload Document from Source Website File Size: 330,43 KBShare Document on Facebook
|