Academic Commons

Reports

Complexity of Approximately Solved Problems

Traub, Joseph F.

As the name of this symposium indicates, its scope is delimited in two ways. We concern ourselves with problems which are approximately solved and we are interested in the complexity of such problems.

Subjects

Files

More About This Work

Academic Units
Computer Science
Publisher
Department of Computer Science, Columbia University
Series
Columbia University Computer Science Technical Reports, CUCS-161-85
Published Here
October 31, 2011