Factoring polynominals over algebraic number fields

No abstract is available for this paper.

• Publication year

  1983

• Venue

  European Conference on Computer Algebra

• Publication date

  1983-03-28

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/3-540-12868-9_108
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The art of computer programming

  1983cited by this paper
• Factoring polynomials with rational coefficients

  1982cited by this paper
• Lattices and Factorization of Polynomials over Algebraic Number Fields

  1982cited by this paper
• The Subresultant PRS Algorithm

  1978cited by this paper
• Factoring Polynomials Over Algebraic Number Fields

  1976cited by this paper
• A Hadamard-Type Bound on the Coefficients of a Determinant of Polynomials (A. J. Goldstein and R. L. Graham)

  1974cited by this paper
• An inequality about factors of polynomials

  1974cited by this paper
• A Hadamard-Type Bound on the Coefficients of a Determinant of Polynomials

  1973cited by this paper
• Factoring polynomials over large finite fields*

  1970cited by this paper

• Kummer theory for number fields via entanglement groups

  2021cites this paper
• Deterministic polynomial factoring over finite fields: A uniform approach via P-schemes

  2020cites this paper
• Dichotomy for Graph Homomorphisms with Complex Values on Bounded Degree Graphs

  2020cites this paper
• Norm relations and computational problems in number fields

  2020cites this paper
• Roots of Unity in Orders

  2015cites this paper
• Candidate Multilinear Maps

  2015cites this paper
• A note on locality of algebras

  2015cites this paper
• Bounded-degree factors of lacunary multivariate polynomials

  2014cites this paper
• List decoding of number field codes

  2013cites this paper
• Candidate Multilinear Maps from Ideal Lattices

  2013cites this paper
• Candidate Multilinear Maps from Ideal Lattices and Applications

  2012cites this paper
• Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding

  2010cites this paper
• Algorithmic Enumeration of Ideal Classes for Quaternion Orders

  2008cites this paper
• Studies on factoring polynomials over global fields

  2007cites this paper
• Complexity upper bounds using permutation group theory

  2006cites this paper
• Doctor of Philosophy (Ph.D)

  2006cites this paper
• Factoring polynomials over global fields I

  2005cites this paper
• Polynomial factorization algorithms over number fields

  2004cites this paper
• On the normalization of numbers and functions defined by radicals

  2003cites this paper
• Algorithms in Pure Mathematics

  2001cites this paper
• Kronecker's and Newton's Approaches to Solving: A First Comparison

  2001cites this paper
• List Decoding of Algebraic-Geometric Codes

  1999cites this paper
• Factoring polynomials over algebraic number fields via norms

  1997cites this paper
• Algorithms for algebras over global fields

  1996cites this paper
• A Database for Number Fields

  1996cites this paper
• Hilbert subsets ands-integral points

  1996cites this paper
• Block Systems of a Galois Group

  1995cites this paper
• On a modular algorithm for computing GCDs of polynomials over algebraic number fields

  1994cites this paper
• Decomposition of Algebraic Functions

  1994cites this paper
• Efficient Resolution of Singularities of Plane Curves

  1994cites this paper
• Factoring integers with the number field sieve

  1993cites this paper
• Parallel gcd and Lattice Basis Reduction

  1992cites this paper
• Algorithms in algebraic number theory

  1992cites this paper
• Parallel lattice basis reduction

  1992cites this paper
• Factoring numbers using singular integers

  1991cites this paper
• Factorization of Polynomials over Finite Fields and Decomposition of Primes in Algebraic Number Fields

  1991cites this paper
• Inversion in Finite Fields Using Logarithmic Depth

  1990cites this paper
• Galois groups and factoring polynomials over finite fields

  1989cites this paper
• Recovery of algebraic numbers from their p-adic approximations

  1989cites this paper
• Computing Primitive Elements of Extension Fields

  1989cites this paper
• The Computation of Polynomial Greatest Common Divisors Over an Algebraic Number Field

  1987cites this paper
• Factorisation of Polynominals: Old Ideas and Recent Results

  1987cites this paper
• The Bath algebraic number package

  1986cites this paper
• Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization

  1985cites this paper
• Polynomial time solutions of some problems of computational algebra

  1985cites this paper
• Factoring Multivariate Polynomials over Algebraic Number Fields

  1984cites this paper
• Factorization of polynomials

  1984cites this paper
• Effective Hilbert Irreducibility

  1984cites this paper
• Hensel and Newton methods in valuation rings

  1984cites this paper