The average-case analysis of numerical problems is the counterpart of the more traditional worst-case approach. The analysis of average error and cost leads to

Introduces exciting new methods for assessing algorithms for problems ranging from clustering to linear programming to neural networks.

This is the second supplementary volume to Kluwer's highly acclaimed eleven-volume Encyclopaedia of Mathematics. This additional volume contains nearly 500 new

This book contains five essays on the complexity of continuous problems, written for a wider audience. The first four essays are based on talks presented in 200

The twin themes of computational complexity and information pervade this 1998 book. It starts with an introduction to the computational complexity of continuous