Advertisement

On the complexity of incremental computation

Extended abstract
  • Suresh Chari
  • Desh Ranjan
  • Pankaj Rohatgi
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 629)

Keywords

Lution 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Blu91]
    A. Blum. Algorithms for Approximate Graph Coloring. PhD thesis, M.I.T., 1991.Google Scholar
  2. [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
  3. [GJ79]
    M.R. Garey and D. Johnson. Computers and Intractability. Freeman, San Fransisco, 1979.zbMATHGoogle Scholar
  4. [JPY88]
    D. Johnson, C. Papadimitriou, and M. Yannakakis. How easy is local search. Journal of Computer and System Sciences, 37:179–200, 1988.MathSciNetCrossRefGoogle Scholar
  5. [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
  6. [Lin65]
    S. Lin. Computer solutions of the traveling salesman problem. Bell System Tech. J., 44:2245–2269, 1965.zbMATHMathSciNetGoogle Scholar
  7. [LK73]
    S. Lin and B.W. Kernighan. An effective heuristic algorithm for the travelling salesman problem. Oper. Res., 11:972–989, 1973.MathSciNetGoogle Scholar
  8. [PR90]
    A. Panconesi and D. Ranjan. Quantifiers and approximation. In 22nd ACM Symposium on Theory of Computing, pages 446–456. ACM, 1990.Google Scholar
  9. [PS82]
    C. Papadimitriou and K. Steiglitz. Combinatorial Algorithms: Algorithms and Complexity. Prentice-Hall, Englewodd Cliffs, NJ, 1982.Google Scholar
  10. [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
  11. [VV86]
    L.G. Valiant and V.V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47(l):85–93, 1986.zbMATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag 1992

Authors and Affiliations

  • Suresh Chari
    • 1
  • Desh Ranjan
    • 1
  • Pankaj Rohatgi
    • 1
  1. 1.Computer Science DepartmentCornell UniversityUSA

Personalised recommendations