Information-based Complexity - Brief History

Brief History

Precursors to IBC may be found in the 1950s by Kiefer, Sard, and Nikolskij. In 1959 Traub had the key insight that the optimal algorithm and the computational complexity of solving a continuous problem depended on the available information. He applied this insight to the solution of nonlinear equations which started the area of optimal iteration theory. This research was published in the 1964 monograph Iterative Methods for the Solution of Equations.

The general setting for information-based complexity was formulated by Traub and Woźniakowski in 1980 in A General Theory of Optimal Algorithms. For a list of more recent monographs and pointers to the extensive literature see To Learn More below.

Read more about this topic:  Information-based Complexity

Famous quotes containing the word history:

    “The principle office of history I take to be this: to prevent virtuous actions from being forgotten, and that evil words and deeds should fear an infamous reputation with posterity.”
    —Tacitus (c. 55–117)

    “We aspire to be something more than stupid and timid chattels, pretending to read history and our Bibles, but desecrating every house and every day we breathe in.”
    —Henry David Thoreau (1817–1862)