Interpolation by decomposable univariate polynomials

Symbolic computation and algebraic computation (68W30) Polynomials in general fields (irreducibility, etc.) (12E05) Computational aspects of algebraic curves (14Q05) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Deformation techniques to solve generalised Pham systems
Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
Functional decomposition of polynomials: the tame case
Definability and fast quantifier elimination in algebraically closed fields
Solving structured linear systems with large displacement rank
Interpolation of polynomials given by straight-line programs
EUROCAL '85. European Conference on Computer Algebra, Linz, Austria, April 1-3, 1985. Proceedings. Vol. 2: Research contributions
Solving zero-dimensional systems through the rational univariate representation
Algebraic geometry I: algebraic curves, algebraic manifolds and schemes. Transl. from the Russian by D. Coray and V. N. Shokurov
Computing parametric geometric resolutions
On the bit complexity of polynomial system solving
Prime and composite polynomials
Directed evaluation
Normal form for Ritt's second theorem
Compositions and collisions at degree \(p^2\)
Improved explicit estimates on the number of solutions of equations over a finite field
On the invariance of chains of fields
Generic local structure of the morphisms in commutative algebra
On the complexity exponent of polynomial system solving
Modern Computer Algebra
Fast Computation of Shifted Popov Forms of Polynomial Matrices via Systems of Modular Polynomial Equations
Ritt's Second Theorem in arbitrary characteristic.
Fast Polynomial Factorization and Modular Composition
Density of real and complex decomposable univariate polynomials
Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
What Can (and Can't) we Do with Sparse Polynomials?
A polynomial time algorithm for computing all minimal decompositions of a polynomial
Counting Decomposable Univariate Polynomials
Combinatorics and Number Theory of Counting Sequences
DENSITY ESTIMATES ON COMPOSITE POLYNOMIALS
Systems of distinct representatives and linear algebra
Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
Polynomial decomposition algorithms
Polynomial decomposition algorithms
Tame decompositions and collisions
A Gröbner free alternative for polynomial system solving
Homogeneous bivariate decompositions
New bounds for matrix multiplication: from alpha to omega

This page was built for publication: Interpolation by decomposable univariate polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614422)