Sciweavers

ANTS
2010
Springer
252views Algorithms» more  ANTS 2010»
15 years 8 months ago
On a Problem of Hajdu and Tengely
Abstract. We answer a question asked by Hajdu and Tengely: The only arithmetic progression in coprime integers of the form (a2 , b2 , c2 , d5 ) is (1, 1, 1, 1). For the proof, we ï...
Samir Siksek, Michael Stoll
165
Voted
ANTS
2010
Springer
260views Algorithms» more  ANTS 2010»
15 years 8 months ago
On the Complexity of the Montes Ideal Factorization Algorithm
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...
David Ford, Olga Veres
ANTS
2010
Springer
262views Algorithms» more  ANTS 2010»
15 years 8 months ago
Short Bases of Lattices over Number Fields
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...
Claus Fieker, Damien Stehlé
ANTS
2010
Springer
246views Algorithms» more  ANTS 2010»
15 years 8 months ago
Class Invariants by the CRT Method
Andreas Enge, Andrew V. Sutherland
AI
2010
Springer
15 years 8 months ago
The IMAP Hybrid Method for Learning Gaussian Bayes Nets
Oliver Schulte, Gustavo Frigo, Russell Greiner, Ha...