Skip to main content
SpringerLink
Log in

On the complexity of incremental computation

Extended abstract

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1992 (MFCS 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 629))

  • 140 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Blum. Algorithms for Approximate Graph Coloring. PhD thesis, M.I.T., 1991.

    Google Scholar 

  2. 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. M.R. Garey and D. Johnson. Computers and Intractability. Freeman, San Fransisco, 1979.

    MATH  Google Scholar 

  4. D. Johnson, C. Papadimitriou, and M. Yannakakis. How easy is local search. Journal of Computer and System Sciences, 37:179–200, 1988.

    Article  MathSciNet  Google Scholar 

  5. 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. S. Lin. Computer solutions of the traveling salesman problem. Bell System Tech. J., 44:2245–2269, 1965.

    MATH  MathSciNet  Google Scholar 

  7. S. Lin and B.W. Kernighan. An effective heuristic algorithm for the travelling salesman problem. Oper. Res., 11:972–989, 1973.

    MathSciNet  Google Scholar 

  8. A. Panconesi and D. Ranjan. Quantifiers and approximation. In 22nd ACM Symposium on Theory of Computing, pages 446–456. ACM, 1990.

    Google Scholar 

  9. C. Papadimitriou and K. Steiglitz. Combinatorial Algorithms: Algorithms and Complexity. Prentice-Hall, Englewodd Cliffs, NJ, 1982.

    Google Scholar 

  10. 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. L.G. Valiant and V.V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47(l):85–93, 1986.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Cornell University, USA

    Suresh Chari, Desh Ranjan & Pankaj Rohatgi

Authors
  1. Suresh Chari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Desh Ranjan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pankaj Rohatgi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ivan M. Havel Václav Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chari, S., Ranjan, D., Rohatgi, P. (1992). On the complexity of incremental computation. In: Havel, I.M., Koubek, V. (eds) Mathematical Foundations of Computer Science 1992. MFCS 1992. Lecture Notes in Computer Science, vol 629. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-55808-X_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-55808-X_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55808-8

  • Online ISBN: 978-3-540-47291-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation