Home

Computational Complexity

Joseph F. Traub

Title:
Computational Complexity
Author(s):
Traub, Joseph F.
Date:
Type:
Technical reports
Department:
Computer Science
Permanent URL:
Series:
Columbia University Computer Science Technical Reports
Part Number:
CUCS-008-80
Publisher:
Department of Computer Science, Columbia University
Publisher Location:
New York
Abstract:
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.
Subject(s):
Computer science
Item views:
372
Metadata:
text | xml
Suggested Citation:
Joseph F. Traub, 1980, Computational Complexity, Columbia University Academic Commons, http://hdl.handle.net/10022/AC:P:11056.

In Partnership with the Center for Digital Research and Scholarship at Columbia University Libraries | Terms of Use | Copyright