Searching for "On Lucky Primes." – sorted by Relevance.
6 documents found, showing 1 through 6.
-
Modular algorithms for computing Gröbner bases
- … is significant (Borosh, 1966). These algorithms typically have three basic steps: first, find a “lucky prime…
- Cited by 10 (0 self) – Add To MetaCart
-
unknown title
- … such integers p lucky numbers. Euler had discovered that the primes p = 2; 3; 5; 11; 17; 41 are lucky. In fact…
- Add To MetaCart
-
Gröbner bases for families of affine or projective schemes. arXiv: math.AC/0608019
- … 2 (Lucky primes and pseudo division) is a characterization of parametric sets in terms of lucky…
- Cited by 1 (0 self) – Add To MetaCart
-
A Gröbner free alternative for polynomial system solving
- …: from a resolution computed modulo a lucky prime number p we can deduce the resolution in Q, and p can…
- Cited by 47 (9 self) – Add To MetaCart
-
Solving Systems of Linear Equations Functionally: a Case Study in Parallelisation
- … in the homomorphic images are started for the lucky primes. A parallel thread is then created to evaluate each…
- Cited by 2 (2 self) – Add To MetaCart
-
Growth Functions and Automatic Groups
- … obtained modulo other (lucky) primes. If we do the computations therefore modulo distinct primes p 1…
- Add To MetaCart
Showing 1 through 6.
