Applications of Topology to Lower Bound Estimates in Computer Science

Michael D. Hirsch

Chapter 37 in From Topology to Computation: Proceedings of the Smalefest, 1993, pp 395-418 from Springer

Abstract: Abstract In recent years, there has been an attempt to bring techniques and tools from pure mathematics to bear on problems in computer science. In particular, the paper of Blum-Shub-Smale [2] developed in detail the concept of computation over the real numbers, showing, for the first time, that real number machines are as rich and robust as classical Turing machines. In this formal framework, one can speak of NP-completeness, problem reduction, and many of the classical problems of (discrete) computer science, on real number computers in a rigorous fashion.

Keywords: Input Space; Open Cover; Point Problem; Output Space; Topological Complexity (search for similar items in EconPapers)
Date: 1993
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-1-4612-2740-3_37

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

DOI: 10.1007/978-1-4612-2740-3_37

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 ().