First Page | Document Content | |
---|---|---|
Date: 2011-05-31 18:17:42Computational complexity theory Mathematics Edsger W. Dijkstra Graph theory Algorithm Mathematical logic Theoretical computer science Shortest path problem NP Dynamic programming | On the Optimality of Top-k Algorithms for Interactive Web Applications∗ Yael Amsterdamer Daniel DeutchAdd to Reading ListSource URL: webdb2011.rutgers.eduDownload Document from Source WebsiteFile Size: 170,67 KBShare Document on Facebook |