Abstract
Information-based complexity seeks to develop general results about the intrinsic difficulty of solving problems where available information is partial or approximate and to apply these results to specific problems. This allows one to determine what is meant by an optimal algorithm in many practical situations, and offers a variety of interesting and sometimes surprising theoretical results.
This is a preview of subscription content, access via your institution
Access options
Subscribe to this journal
Receive 51 print issues and online access
$199.00 per year
only $3.90 per issue
Buy this article
- Purchase on Springer Link
- Instant access to full article PDF
Prices may be subject to local taxes which are calculated during checkout
Similar content being viewed by others
References
1. Traub, J. F. & Wozniakowski, H. in Advances in Computers 23, (ed. Yovits, M.) 35–92 (Academic, New York, 1984). 2. Wozniakowski, H. A. Rev. Comput. Sci. 1, 319–380 (1986). 3. Packel, E. W. & Wozniakowski, H. Bull. Am. Math. Soc. (in the press). 4. Garey, M. R. & Johnson, D. S. Computers and Intractability (Freeman, San Francisco, 1979). 5. Sard, A. Am. J. Math. 71, 80–91 (1949). 6. Nikolskij, S. M. Usp. Math. Nauk 5, 165–177 (1950). 7. Kiefer, J. Proc. Am. Math. Soc. 4, 502–505 (1953). 8. Shub, M. & Smale, S. Annales Scientifique de UEcole Normale Superieure 4 serie, 18 (1985), 9. Shub, M. & Smale, S. / Complexity 2, 2–11 (1986). 10. Smale, S. Bull. Am. Math. Soc. 13, 87–121 (1985). 11. Traub, J. F. & Wozniakowski, H. A General Theory of Optimal Algorithms (Academic, New York, 1980). 12. Wasilkowski, G. W. J. Complexity 1, 107–117 (1985). 13. Wasilkowski, G. W. & Wozniakowski, H. Comp. Sci. Department Report (Columbia Univer-sity, 1984). 14. Wozniakowski, H. J. Complexity 2, 255–269 (1986). 15. Wozniakowski, H. in Proceedings of Optimal Algorithms (Bulgarian Academy of Science, Sofia, 1986). 16. Wasilkowski, G. W. Comput. Sci. Dept Rep. (Columbia University, 1987). 17. Bartholdi, J. J. & Ford, J. Physics Today 38, 75–76 (June, 1985). 18. Smolyak, S. A. Dissertation, Moscow State Univ. (1965). 19. Osipenko, K. Yu Mat. Zametki 19, 29–40 (1976). (English Translation Math. Notes 19, 17–23 (1976).) 20. Packel, E. W. Aequationes Math. 31, 18–25 (1986). 21. Werschulz, A. G. & Wozniakowski, H. Aequationes Math. 31, 202–211 (1986). 22. Poggio, T., Torre, V. & Koch, C. Nature 317, 314–319 (1985). 23. Lee, D. J. Complexity 1, 138–146 (1985). 24. Lee, D. thesis, Columbia University (1985). 25. Kowalski, M. A. / Complexity 2, 239–254 (1986). 26. Milanese, M. & Tempo, R. IEEE Trans. Autom. Contr. AC 30, 730–738 (1985). 27. Milanese, M., Tempo, R., & Vicino, A. /. Complexity 2, 78–94 (1986). 28. Halpern, J. Y., Simons, B. B., Strong, H. R., & Dolev, D. in Proceedings of the 3rd ACM Conference on Principles of Distributed Computing, 89–102 (1984). 29. Lynch, N. A. & Lundelius, J. Information and Control 62, 190–204 (1985). 30. Wasilkowski, G. W. Comput. Sci. Dept Rep. (Columbia University, 1986). 31. Micchelli, C. A. & Rivlin, T. J. in Optimal Estimation in Approximation Theory (eds MicchelH, C. A. & Rivlin, T. J.) 1–54 (Plenum, New York, 1977). 32. Nemirovsky, A. S. & Yudin, D. B. Problem Complexity and Method Efficiency in Optimization (Wiley, New York, 1983). 33. Twomey, S. Introduction to Mathematics of Inversion in Remote Sensing and Indirect Measure-ments, Developments in Geomathematics 3 (Elsiever, Amsterdam, 1977). 34. Werschulz, A. G. Comput. Sci. Dept Rep. (Columbia University, 1986). 35. Bakhvalov, N. S. U.S.S.R. Comput. Math. Phys. 68–82 (1961). 36. Babenko, V. F. Math. Notes 19, 187–193 (1976). 37. Sukharev, A. G. Sou. Math. Dokl. 20, 472–475 (1979). 38. Schonhage, A. Report (University of Tubingen, 1982). 39. Renegar, J. Math. Dept. Rep. (Colorado State Univ., 1985). 40. Sikorski, K. J. Complexity 1, 197–209 (1985). 41. Kuczyriski, J. / Complexity 2, 131–162 (1986). 42. Kacewicz, B. Z. BIT 23, 217–230 (1983). 43. Kacewicz, B. Z. Numer. Math. 43, 93–104 (1984). 44. Werschulz, A. G. / Complexity 1, 232–255 (1985). 45. Traub, J. F. & Wozniakowski, H. Journal of the ACM 31, 545–559 (1984). 46. Werschulz, A. G. /. Integral Equations 9, 213–241 (1985). 47. Babenko, K. I. in Theoretical Background and Constructing of Computational Algorithms for Mathematical–Physical Problems (ed. Babenko, K. I.), (Nauka, Moscow, 1979). 48. Lee, D. & Wasilkowski, G. W. J. Complexity 2, 12–43 (1986). 49. Papageorgiou, A. & Wasilkowski, G. W. Comput. Sci. Dept Rep. (Columbia University, 1986). 50. Gal, S. & Micchelli, C. A. Appl. Analyt. 10, 105–120 (1980). 51. Wasilkowski, G. W. J. Complexity 2, 209–228 (1986). 52. Packel, E. W., Traub, J. F. & Wozniakowski, H. Comp. Sci. Department Report (Columbia University, 1987). 53. Packel, E. W. SIAM Rev. (in the press). 54. Traub, J. F., Wasilkowski, G. W. & Wozniakowski, H. Information–Based Complexity (Academic, New York, in the press).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Packel, E., Traub, J. Information-based complexity. Nature 328, 29–33 (1987). https://doi.org/10.1038/328029a0
Issue Date:
DOI: https://doi.org/10.1038/328029a0
This article is cited by
-
New optimization methods from physics and biology
Nature (1987)
Comments
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.
