Fast online multiplication of real numbers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1200, Issue , 1997, Pages 81-92

  Schröder, Matthias ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

Computable real analysis; Computational complexity; Online computations

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; COMPUTERS;

COMPUTABLE REALS; COMPUTATIONAL MODEL; INTEGER MULTIPLICATIONS; ON-LINE ALGORITHMS; ONLINE COMPUTATIONS; REAL FUNCTIONS; REAL NUMBER;

APPROXIMATION ALGORITHMS;

EID: 84949643786     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0023450     Document Type: Conference Paper

References (15)

1. [BSS89] L. Blum, M. Shub, S. Smale: On a theory of computation and complexity over the real numbers, Bull. Amer. Math. Soc. 21, pp. 1-46 (1989)
2. [DHM89] J. Duprat, Y. Herreros, J. M. Muller: Some results about on-line computation of functions, Proc. 9th IEEE Symposium on Computer Arithmetic, IEEE Computer Society Press, Los Alamitos, pp. 112-118 (1989)
3. [FS74] M. Fischer, L. Stockmeyer: Fast On-line Integer Multiplication, Journal of Computer and System Sciences 9 (1974)
4. [Ho90] H.J. Hoover: Feasible real functions and arithmetic circuits, SIAM Journal of Computing 19, pp. 182-204 (1990)
5. [Ko91] Ker-I Ko: Complexity Theory of Real Functions, Birkhäuser, Boston (1991)
6. [La95] B. Landgraf: Schnelle beinahe Online-Multiplikation reeller Zahlen, Diplomarbeit, Fernuniversität Hagen (1995)
7. [Mü86] N. Müller: Computational Complexity of Real Functions and Real Numbers, Informatik Berichte Nr. 59, Fernuniversität Hagen (1986)
8. [PFM74] M. Paterson, M. Fischer, A. Meyer: An Improved Overlap Argument For On-Line Multiplication, SIAM-AMS Proceedings Volume 7 (1974)
9. [PR89] M. Pour-El, J. Richards: Computability in Analysis and Physics, Springer-Verlag, Berlin, Heidelberg (1989)
10. [SS71] A. Schönhage, V. Strassen: Schnelle Multiplikation groβer Zahlen, Computing 7, (1971)
11. [Sch95] M. Schröder: Topological Spaces Allowing Type 2 Complexity Theory, in: Workshop on Computability and Complexity in Analysis, Informatik Berichte Nr. 190, Fernuniversität Hagen (1995)
12. [We91] K. Weihrauch: On the Complexity of Online Computations of Real Functions, Journal of Complexity 7, pp. 340-394 (1991)
13. [We87] K. Weihrauch: Computability, Springer-Verlag, Berlin, Heidelberg (1987)
14. [We95a] K. Weihrauch: A Simple Introduction to Computable Analysis, Informatik Berichte Nr. 171, Fernuniversität Hagen (1995)
15. [We95b] K. Weihrauch: A Foundation of Computable Analysis, in: EATCS Bulletin Nr. 57, pp. 167-182 (October 1995)