Skip to Main Content

Bulletin of the American Mathematical Society

The Bulletin publishes expository articles on contemporary mathematical research, written in a way that gives insight to mathematicians who may not be experts in the particular topic. The Bulletin also publishes reviews of selected books in mathematics and short articles in the Mathematical Perspectives section, both by invitation only.

ISSN 1088-9485 (online) ISSN 0273-0979 (print)

The 2020 MCQ for Bulletin of the American Mathematical Society is 0.84.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Book Review

The AMS does not provide abstracts of book reviews. You may download the entire review from the links below.


Full text of review: PDF   This review is available free of charge.
Book Information:

Authors: J. F. Traub and A. G. Werschulz
Title: Complexity and information
Additional book information: Cambridge University Press, Cambridge, 1998, xii + 139 pp., ISBN ISBN 0-521-48506-1, $19.95$, paperback

References [Enhancements On Off] (What's this?)

  • Lenore Blum, Mike Shub, and Steve Smale, On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines, Bull. Amer. Math. Soc. (N.S.) 21 (1989), no. 1, 1–46. MR 974426, DOI 10.1090/S0273-0979-1989-15750-9
  • Lenore Blum, Felipe Cucker, Michael Shub, and Steve Smale, Complexity and real computation, Springer-Verlag, New York, 1998. With a foreword by Richard M. Karp. MR 1479636, DOI 10.1007/978-1-4612-0701-6
    • [CA]
    D. Ceperley and B. Adler, Quantum Monte Carlo, Science 231 (1986), 555-560.
  • Morris W. Hirsch and Stephen Smale, On algorithms for solving $f(x)=0$, Comm. Pure Appl. Math. 32 (1979), no. 3, 281–313. MR 517937, DOI 10.1002/cpa.3160320302
    • [L]
    S. Lloyd, Measures of Complexity, Department of Mechanical Engineering, Massachusetts Institute of Technology, Cambridge, MA.
  • Edward W. Packel and Henryk Woźniakowski, Recent developments in information-based complexity, Bull. Amer. Math. Soc. (N.S.) 17 (1987), no. 1, 9–36. MR 888879, DOI 10.1090/S0273-0979-1987-15511-X
    • [PT]
    E. Packel and J. Traub, Information-based complexity,$\,$Nature 327 (1987), 29-33.
  • Steve Smale, On the efficiency of algorithms of analysis, Bull. Amer. Math. Soc. (N.S.) 13 (1985), no. 2, 87–121. MR 799791, DOI 10.1090/S0273-0979-1985-15391-1
  • Ian H. Sloan and Henryk Woźniakowski, When are quasi-Monte Carlo algorithms efficient for high-dimensional integrals?, J. Complexity 14 (1998), no. 1, 1–33. MR 1617765, DOI 10.1006/jcom.1997.0463
    • [Tr]
    J. Traub, On reality and models, in Boundaries and Barriers: On the Limits to Scientific Knowledge, Addison-Wesley, Reading, 1996, 238-254.
    [TW]
    J. Traub and H. Wo $\acute{\text{z}}$niakowski, Breaking intractability, Scientific American 270 (1994), 102-107.
  • J. F. Traub, Iterative methods for the solution of equations, Prentice-Hall Series in Automatic Computation, Prentice-Hall, Inc., Englewood Cliffs, N.J., 1964. MR 0169356
  • J. F. Traub, G. W. Wasilkowski, and H. Woźniakowski, Information-based complexity, Computer Science and Scientific Computing, Academic Press, Inc., Boston, MA, 1988. With contributions by A. G. Werschulz and T. Boult. MR 958691
  • Arthur G. Werschulz, The computational complexity of differential and integral equations, Oxford Mathematical Monographs, The Clarendon Press, Oxford University Press, New York, 1991. An information-based approach; Oxford Science Publications. MR 1144521
    • [Wo]
    H. Wo $\acute{\text{z}}$niakowski, Complexity of multivariate problems with applications to path integrals, Z. Angew. Math. Mech. 3 (1996), 131-134.
    Review Information:

    Reviewer: Mark A. Kon
    Affiliation: Boston University
    Email: mkon@math.bu.edu
    Journal: Bull. Amer. Math. Soc. 37 (2000), 199-204
    DOI: https://doi.org/10.1090/S0273-0979-99-00859-9
    Published electronically: December 21, 1999
    Review copyright: © Copyright 2000 American Mathematical Society