Abstract

Computational complexity studies the intrinsic difficulty of mathematically posed problems and seeks optimal means for their solutions. This is a rich and diverse field; for the purpose of this paper we present a greatly simplified picture. Computational complexity may be divided into two branches, discrete and continuous.

Citations

8881	D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness - Garey, Johnson - 1979
640	The Symmetric Eigenvalue Problem - Parlett - 1998
91	Problem Complexity and Method Efficiency in Optimization - Nemirovski, Yudin - 1983
50	A general theory of optimal algorithms - Traub, Wo´zniakowski - 1980
45	On irregularities of distribution - Roth
41	The Computational Complexity of Differential and Integral Equations: An Information-Based Approach - Werschulz - 1991
33	Estimating the largest eigenvalue by the power and Lanczos algorithms with a random start - Kuczyński, Wo´zniakowski - 1992
30	Sequential minimax search for a maximum - Kiefer - 1953
24	Kernel polynomials in linear algebra and their numerical applications - Stiefel - 1958
19	Families of rational maps and iterative rootfinding algorithms - McMullen - 1987
6	approximate integration formulas, best approximate formulas - Best - 1949
6	On the existence of generally convergent algorithms - Shub, Smale - 1986
5	On Numerical Approximation - Golomb, Weinberger - 1959
5	On optimality of Krylov’s information when solving linear operator equations - Nemirovsky - 1991
4	Information-based numerical practice - Babuska - 1987
4	Complexity of solving linear systems in different models of computation - Bojańczyk - 1984
4	s-Numbers in information-based complexity - Mathé - 1990
4	Spline interpolation and best quadrature formulas - Schoenberg - 1964
3	On the Optimality of Krylov Information - Chou - 1987
3	On the power of adaptive information for functions with singularities - Wasilkowski, Gao - 1992
2	On sequential and parallel solution of initial value problems - Kacewicz - 1990
2	On the minimal cost of approximating linear problems based on information with deterministic noise - Kacewicz, Plaskota - 1990
2	How powerful is continuous nonlinear information for linear problems - Kacewicz, Wasilkowski - 1986
2	On the optimal solution of large eigenpair problems - Kuczyński - 1986
2	Information-based complexity, Nature 328 - Packel, Traub - 1987
2	Review of Information, uncertainty, complexity, by - Shub - 1983
1	3–18. (Russian) , Numerical Methods for the Solution of Differential and Integral Equations and Quadrature Formulas , “Nauka - Khim - 1959
1	On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines - Phys - 1971
1	On detecting regularity of functions, work in progress - Gao, Wasilkowski - 1990
1	On the problem of approximation estimate by quadrature formulas, Uspekhi - Nikolskiĭ - 1950
1	Complexity of Computer Computations - Rabin - 1972
1	complexity: New questions for mathematicians - Information-based - 1981
1	A survey of information based-complexity - Wo´zniakowski - 1985
1	Numerical Methods for the Solution of Differential and Integral Equations and Quadrature Formulas , “Nauka - Khim - 1959