Computational Complexity

Oded Goldreich

A chapter in Mathematics Unlimited — 2001 and Beyond, 2001, pp 507-524 from Springer

Abstract: Abstract Computational Complexity (also known as Complexity Theory) is a central field of Computer Science1 with a remarkable list of celebrated achievements as well as a very vibrant research activity. The field is concerned with the study of the intrinsic complexity of computational tasks, and this study tends to aim at generality: it focuses on natural computational resources, and considers the effect of limiting these resources on the class of problems that can be solved.

Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-56478-9_25

Ordering information: This item can be ordered from
http://www.springer.com/9783642564789

DOI: 10.1007/978-3-642-56478-9_25

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().