𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of the Descartes method when using approximate arithmetic

✍ Scribed by Sagraloff, Michael

Book ID
122196158
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
661 KB
Volume
65
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The bit-operation complexity of approxim
The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic
✍ V. Pan πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 330 KB

The approximate evaluation with a given precision of matrix and polynomial products is performed using modular arithmetic. The resulting algorithms are numerically stable. At the same time they are as fast as or faster than the algorithms with arithmetic operations over real or complex numbers.

On the complexity of finding common appr
On the complexity of finding common approximate substrings
✍ Patricia A. Evans; Andrew D. Smith; H.Todd Wareham πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 323 KB

Problems associated with ΓΏnding strings that are within a speciΓΏed Hamming distance of a given set of strings occur in several disciplines. In this paper, we use techniques from parameterized complexity to assess non-polynomial time algorithmic options and complexity for the COMMON APPROXIMATE SUBST