Corpus ID: 115303441

On the complexity of polynomial factorization over P-adic fields

@inproceedings{Veres2009OnTC,
  title={On the complexity of polynomial factorization over P-adic fields},
  author={Olga Veres},
  year={2009}
}
Let p be a rational prime and Z( x ) be a monic irreducible polynomial in Z p [ x ]. Based on the work of Ore on Newton polygons (Ore, 1928) and MacLane's characterization of polynomial valuations (MacLane, 1936), Montes described an algorithm for the decomposition of the ideal [Special characters omitted.] over an algebraic number field (Montes, 1999). We give a simplified version of the Montes algorithm with a full MAPLE implementation which tests the irreducibility of Z( x ) over Q p . We… Expand
8 Citations
On the Complexity of the Montes Ideal Factorization Algorithm
  • 11
  • PDF
Computing with quadratic forms over number fields
  • 4
  • PDF
Factoring Polynomials over Local Fields II
  • S. Pauli
  • Mathematics, Computer Science
  • ANTS
  • 2010
  • 15
  • PDF
Computing Integral Closure Workshop
  • PDF

References

SHOWING 1-10 OF 27 REFERENCES
On fast multiplication of polynomials over arbitrary algebras
  • 282
  • PDF
Fast construction of irreducible polynomials over finite fields
  • V. Shoup
  • Computer Science, Mathematics
  • SODA '93
  • 1993
  • 144
Factoring polynomials with rational coefficients
  • 3,756
  • PDF
On a Theorem of Ore
  • 36
The Construction of Maximal Orders Over a Dedekind Domain
  • D. Ford
  • Computer Science, Mathematics
  • J. Symb. Comput.
  • 1987
  • 25
  • Highly Influential
A construction for absolute values in polynomial rings
  • 145
  • PDF
Gaussian elimination is not optimal
  • 2,255
  • PDF
Factoring Polynomials Over Local Fields
  • S. Pauli
  • Computer Science, Mathematics
  • J. Symb. Comput.
  • 2001
  • 27
  • Highly Influential
Factoring polynomials over finite fields
  • 224
...
1
2
3
...