Fast online multiplication of real numbers
From MaRDI portal
Publication:5047161
DOI10.1007/BFB0023450zbMATH Open1498.68377OpenAlexW1581155791MaRDI QIDQ5047161FDOQ5047161
Authors: Matthias Schröder
Publication date: 9 November 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0023450
Recommendations
Online algorithms; streaming algorithms (68W27) Analysis of algorithms and problem complexity (68Q25) Computation over the reals, computable analysis (03D78)
Cites Work
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Fast multiplication of large numbers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Feasible Real Functions and Arithmetic Circuits
- Fast on-line integer multiplication
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the complexity of online computations of real functions
Cited In (9)
- Online computations of differentiable functions
- Fast on-line integer multiplication
- Fast on-line integer multiplication
- Title not available (Why is that?)
- Title not available (Why is that?)
- Feasible real random access machines
- Relaxed Hensel lifting of triangular sets
- A simple and fast online power series multiplication and its analysis
- Title not available (Why is that?)
This page was built for publication: Fast online multiplication of real numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5047161)