1980 Reports
Computational Complexity
This paper approaches computational complexity as the determination of the intrinsic difficulty of mathematically posed problems arising in many disciplines. The study of complexity has led to more efficient algorithms than those previously known or suspected.
Files
-
cucs-008-80.pdf
application/pdf
480 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-008-80
- Published Here
- August 31, 2011