Factoring Multivariate Polynomials over Algebraic Number Fields
From MaRDI portal
Publication:3775638
DOI10.1137/0216040zbMath0636.12005OpenAlexW2095461769MaRDI QIDQ3775638
Publication date: 1987
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/6598
Symbolic computation and algebraic computation (68W30) Polynomials (irreducibility, etc.) (11R09) Software, source code, etc. for problems pertaining to field theory (12-04)
Related Items
Factoring multivariate polynomials via partial differential equations ⋮ Algorithms for near solutions to polynomial equations ⋮ Infinitely many eigenfunctions for polynomial problems: exact results ⋮ Bounded-degree factors of lacunary multivariate polynomials ⋮ Algorithms in Algebraic Number Theory ⋮ An efficient algorithm for factoring polynomials over algebraic extension field ⋮ A non-NP-complete algorithm for a quasi-fixed polynomial problem ⋮ Factoring bivariate sparse (lacunary) polynomials ⋮ Skolem functions of arithmetical sentences. ⋮ Computational complexity of sentences over fields ⋮ Points at rational distances from the vertices of certain geometric objects ⋮ Polynomial time algorithms for sentences over number fields ⋮ Optimal algorithm for algebraic factoring ⋮ An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation ⋮ Complexity of solving parametric polynomial systems ⋮ An empirical study of cache-oblivious polygon indecomposability testing ⋮ Infinitely many quasi-coincidence point solutions of multivariate polynomial problems ⋮ Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding ⋮ Algebraic factoring and geometry theorem proving ⋮ Parallel methods for absolute irreducibility testing ⋮ On interpolating arithmetic read-once formulas with exponentiation ⋮ Decomposing algebraic sets using Gröbner bases ⋮ Sentences over integral domains and their computational complexities ⋮ Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey ⋮ Approximate solutions of polynomial equations.
