Read Anywhere and on Any Device!

Subscribe to Read | $0.00

Join today and start reading your favorite books for Free!

Create Free Account

Complexity and Real Computation

4.2/5 ( ratings)

Computational complexity theory provides a framework for understanding the cost of solving computational problems, as measured by the requirement for resources such as time and space. The objects of study are algorithms defined within a formal model of computation. Upper bounds on the computational complexity of a problem are usually derived by constructing and analyzing specific algorithms. Meaningful lower bounds on computational complexity are harder to come by, and are not available for most problems of interest. The dominant approach in complexity theory is to consider algorithms as oper- ating on finite strings of symbols from a finite alphabet. Such strings may represent various discrete objects such as integers or algebraic expressions, but cannot rep- resent real or complex numbers, unless the numbers are rounded to approximate values from a discrete set. A major concern of the theory is the number of com- putation steps required to solve a problem, as a function of the length of the input string.

Language: English

Pages: 453

Format: Hardcover

Publisher: Springer

Release: October 30, 1997

ISBN: 0387982817

ISBN 13: 9780387982816

Complexity and Real Computation

4.2/5 ( ratings)

Computational complexity theory provides a framework for understanding the cost of solving computational problems, as measured by the requirement for resources such as time and space. The objects of study are algorithms defined within a formal model of computation. Upper bounds on the computational complexity of a problem are usually derived by constructing and analyzing specific algorithms. Meaningful lower bounds on computational complexity are harder to come by, and are not available for most problems of interest. The dominant approach in complexity theory is to consider algorithms as oper- ating on finite strings of symbols from a finite alphabet. Such strings may represent various discrete objects such as integers or algebraic expressions, but cannot rep- resent real or complex numbers, unless the numbers are rounded to approximate values from a discrete set. A major concern of the theory is the number of com- putation steps required to solve a problem, as a function of the length of the input string.

Language: English

Pages: 453

Format: Hardcover

Publisher: Springer

Release: October 30, 1997

ISBN: 0387982817

ISBN 13: 9780387982816

More books from Michael Shub

The Mathematics of Numerical Analysis: 1995 Ams-Siam Summer Seminar in Applied Mathematics, July 17-August 11, 1995, Park City, Utah

From Topology to Computation: Proceedings of the Smalefest

Global Stability of Dynamical Systems

Rate this book!

Write a review?