Counting problems over the reals
- In this paper we introduce a complexity theoretic notion of counting problems over the real numbers. We follow the approaches of Blum, Shub, and Smale.
Author: | Klaus MeerGND |
---|---|
URL: | http://www.springer.com/us/book/9783540634379?wt_mc=ThirdParty.SpringerLink.3.EPR653.About_eBook |
DOI: | https://doi.org/10.1007/BFb0029983 |
ISBN: | 978-3-540-63437-9 |
Title of the source (English): | Mathematical foundations of computer science 1997, 22nd international symposium, proceedings, MFCS '97, Bratislava, Slovakia, August 25 - 29, 1997 |
Publisher: | Springer |
Place of publication: | Berlin [u.a.] |
Editor: | Igor Prívara, Peter Ružička |
Document Type: | Conference Proceeding |
Language: | English |
Year of publication: | 1997 |
First Page: | 398 |
Last Page: | 407 |
Series ; volume number: | Lecture notes in computer science ; 1295 |
Faculty/Chair: | Fakultät 1 MINT - Mathematik, Informatik, Physik, Elektro- und Informationstechnik / FG Theoretische Informatik |