## Information-based complexity (1988)

by
J. F. Traub

Citations: | 217 - 34 self |

### BibTeX

@MISC{Traub88information-basedcomplexity,

author = {J. F. Traub},

title = {Information-based complexity},

year = {1988}

}

### Years of Citing Articles

### OpenURL

### 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.