On the complexity of incremental computation
Part of the Lecture Notes in Computer Science book series (LNCS, volume 629)
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- [Blu91]A. Blum. Algorithms for Approximate Graph Coloring. PhD thesis, M.I.T., 1991.Google Scholar
- [FGL+91]U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy. Approximating Clique is Almost NP-Complete. In 32nd Symposium on Foundation of Computer Science, pages 2–12, 1991.Google Scholar
- [KPS90]J. Krajíček, P. Pudlk, and J. Sgall. Interactive Computation of Optimal Solutions. In Mathematical Foundations of Computer Science, Springer-Verlag LNCS #452, 1990.Google Scholar
- [PR90]A. Panconesi and D. Ranjan. Quantifiers and approximation. In 22nd ACM Symposium on Theory of Computing, pages 446–456. ACM, 1990.Google Scholar
- [PS82]C. Papadimitriou and K. Steiglitz. Combinatorial Algorithms: Algorithms and Complexity. Prentice-Hall, Englewodd Cliffs, NJ, 1982.Google Scholar
- [RCR91]D. Ranjan, S. Chari, and P. Rohtagi. Improving known solutions is hard. In Proceedings of the 18 th ICALP, pages 381–392. Springer-Verlag, 1991. Lecture Notes in Computer Science # 510.Google Scholar
© Springer-Verlag 1992