1996 Reports
Overview of information-based complexity
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
-
demo title for ac:110257
application/octet-stream
48 KB
Download File
-
cucs-024-96.pdf
application/pdf
181 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