Computational Complexity

descriptionPublicationkeyboard_double_arrow_right Other literature type , Report 01 Jan 1980 United States Publisher:Department of Computer Science, Columbia University

Authors: Traub, Joseph F.;

doi: 10.7916/d88k7j2j

Computational Complexity

- Summary
- Subjects
- Metrics

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.

Country

United States

Related Organizations

Columbia University Libraries, Open Scholarship Services
United States
Columbia University Libraries, Digital Scholarship
United States
Columbia University
United States

Keywords

Computational complexity, Matrices, Computer science--Mathematics, Algorithms, 004, 510

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

0

Average

Green