Efficient rational number reconstruction
From MaRDI portal
Recommendations
Cited in
(18)- On computing subfields. A detailed description of the algorithm
- Computing local Artin maps, and solvability of norm equations
- Computing ideals of points
- Fault-tolerant modular reconstruction of rational numbers
- Fast rational function reconstruction
- Modification of an algorithm for selected terms of the integer extended Euclidean matrix sequence
- Computing automorphisms of abelian number fields
- On Rational Number Reconstruction and Approximation
- Maximal quotient rational reconstruction
- Acceleration of Euclidean algorithm and extensions
- Acceleration of Euclidean Algorithm and Rational Number Reconstruction
- Deciding the nilpotency of the Galois group by computing elements in the centre
- Random arithmetic formulas can be reconstructed efficiently
- Vector rational number reconstruction
- Half-GCD and fast rational recovery
- The use of bad primes in rational reconstruction
- Solving Linear Systems in $\widetilde{O}(mn \log \fracκε)$ Bit Operations
- Algorithms for solving linear systems over cyclotomic fields
This page was built for publication: Efficient rational number reconstruction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1914163)
