The use of bad primes in rational reconstruction (Q5501158): Difference between revisions

@@ Property / cites work @@
+Q4305609
@@ Property / cites work: Q4305609 / rank @@
+Normal rank
@@ Property / cites work @@
+Modular algorithms for computing Gröbner bases.
@@ Property / cites work: Modular algorithms for computing Gröbner bases. / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel algorithms for normalization
@@ Property / cites work: Parallel algorithms for normalization / rank @@
+Normal rank
@@ Property / cites work @@
+Local to Global Algorithms for the Gorenstein Adjoint Ideal of a Curve
+Normal rank
@@ Property / cites work @@
+Efficient rational number reconstruction
@@ Property / cites work: Efficient rational number reconstruction / rank @@
+Normal rank
@@ Property / cites work @@
+Computing GCDs of polynomials over algebraic number fields
+Normal rank
@@ Property / cites work @@
+Normalization of rings
@@ Property / cites work: Normalization of rings / rank @@
+Normal rank
@@ Property / cites work @@
+Parallelization of modular algorithms
@@ Property / cites work: Parallelization of modular algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Low-dimensional lattice basis reduction revisited
@@ Property / cites work: Low-dimensional lattice basis reduction revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Mapping integers and Hensel codes onto Farey fractions
+Normal rank
@@ Property / cites work @@
+Q3947115
@@ Property / cites work: Q3947115 / rank @@
+Normal rank
@@ Property / cites work @@
+P-adic reconstruction of rational numbers
@@ Property / cites work: P-adic reconstruction of rational numbers / rank @@
+Normal rank