Academic Commons

Reports

Overview of information-based complexity

Wozniakowski, Henryk

Computational complexity studies the intrinsic difficulty of solving mathematically posed problems. Discrete computational complexity studies discrete problems
and often uses the Turing machine model of computation. Continuous computational complexity studies continuous problems and tends to use the real number
model.

Subjects

Files

  • thumnail for demo title for ac:110257 demo title for ac:110257 application/octet-stream 48 KB Download File

More About This Work

Academic Units
Computer Science
Publisher
Department of Computer Science, Columbia University
Series
Columbia University Computer Science Technical Reports, CUCS-024-96
Published Here
April 25, 2011
Academic Commons provides global access to research and scholarship produced at Columbia University, Barnard College, Teachers College, Union Theological Seminary and Jewish Theological Seminary. Academic Commons is managed by the Columbia University Libraries.