Effective Noether irreducibility forms and applications
From MaRDI portal
Publication:1892221
DOI10.1006/jcss.1995.1023zbMath0844.12006OpenAlexW4210639400MaRDI QIDQ1892221
Publication date: 13 July 1995
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0071f151b3a397f63cf80e08836711c0ffa0ea4d
complexityalgorithmmultivariate polynomialabsolute irreducibility of bivariate formseffective bound for the Ostrowski theoremeffective Hilbert irreducibility theoremeffective Noether irreducibility formsgrowth of degreesgrowth of normsirreducibility formspolynomial with symbolic coefficients
Analysis of algorithms and problem complexity (68Q25) Hilbertian fields; Hilbert's irreducibility theorem (12E25)
Related Items
Specified precision polynomial root isolation is in NC, Factoring multivariate polynomials via partial differential equations, Lifting and recombination techniques for absolute factorization, Families of polynomials and their specializations, Semi-numerical absolute factorization of polynomials with integer coefficients, An application of random plane slicing to counting \(\mathbb{F}_q\)-points on hypersurfaces, Modular Las Vegas algorithms for polynomial absolute factorization, Factoring bivariate sparse (lacunary) polynomials, Nonsingular points on hypersurfaces over \(\mathbb F_q\), Irreducibility of polynomials modulo \(p\) via Newton polytopes., Points of bounded height on curves and the dimension growth conjecture over Fq[t$\mathbb {F}_q[t]$], On the total order of reducibility of a pencil of algebraic plane curves, Improved dense multivariate polynomial factorization algorithms, New recombination algorithms for bivariate polynomial factorization based on Hensel lifting, Absolute irreducibility of polynomials via Newton polytopes, Typical ranks ofm×n× (m− 1)ntensors with 3 ≤m≤nover the real number field, Improved explicit estimates on the number of solutions of equations over a finite field, Indecomposability of polynomials via Jacobian matrix, Solving degenerate sparse polynomial systems faster, Factorization of polynomials given by arithmetic branching programs, Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey, Fast computation of a rational point of a variety over a finite field, Uniform bounds for the number of rational points on varieties over global fields, Linear differential operators for polynomial equations, Equivalence of polynomial identity testing and polynomial factorization, Control of the non-geometrically integral reductions, Probabilistic absolute irreducibility test for polynomials, SMOOTHNESS IN PENCILS OF HYPERSURFACES OVER FINITE FIELDS
