Polynomial decomposition algorithms

DOI10.1016/S0747-7171(89)80027-6zbMATH Open0691.68030MaRDI QIDQ5893804FDOQ5893804

Authors: Dexter Kozen, Susan Landau 

Publication date: 1989

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Recommendations

• Functional decomposition of polynomials: the tame case
• scientific article; zbMATH DE number 4154575
• Functional decomposition of polynomials: the wild case
• scientific article; zbMATH DE number 2125607
• scientific article; zbMATH DE number 4101330

zbMATH Keywords

computer algebrafunctional decomposition of polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomials over commutative rings (13B25)

Cites Work

• Title not available (Why is that?)
• Fast Algorithms for Manipulating Formal Power Series
• Fast Parallel Computation of Polynomials Using Few Processors
• Solvability by radicals is in polynomial time
• Fast Parallel Matrix Inversion Algorithms
• On the invariance of chains of fields
• Polynomial Substitutions
• Prime and composite polynomials
• Composite Polynomials with Coefficients in an Arbitrary Field of Characteristic Zero
• Polynomial decomposition algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (41)

• Algorithmic Polynomials
• Counting decomposable univariate polynomials
• Title not available (Why is that?)
• Sparse shifts for univariate polynomials
• Algorithmic polynomials
• Counting invariant subspaces and decompositions of additive polynomials
• Two questions on polynomial decomposition
• Decomposition of ordinary difference polynomials
• On the decomposition of rational functions
• Algorithms for computing triangular decompositions of polynomial systems
• A test for additive decomposability of irreducibles over a finite field
• Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem
• \(\sqrt{2}+\sqrt{3}\): Four different views
• Computational problems in the theory of finite fields
• Decomposition of ordinary differential polynomials
• Algebraic computation of resolvents without extraneous powers
• Normal form for Ritt's second theorem
• A recombination algorithm for the decomposition of multivariate rational functions
• Title not available (Why is that?)
• Interpolation by decomposable univariate polynomials
• Title not available (Why is that?)
• Compositions and collisions at degree \(p^2\)
• Algorithms for the Polar Decomposition
• A short proof for the open quadrant problem
• Algebraic Condition for Decomposition of Large-Scale Linear Dynamic Systems
• Title not available (Why is that?)
• An algorithm for the decomposition of differential polynomials in the general case
• A polynomial time algorithm for computing all minimal decompositions of a polynomial
• Universal decomposition algebra
• Polynomial decomposition algorithms
• Decomposition of polynomials and approximate roots
• Functional decomposition of polynomials: the wild case
• The inverse of an automorphism in polynomial time
• Counting decomposable polynomials with integer coefficients
• Identification of Hammerstein–Wiener models with hysteresis front nonlinearities
• An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography
• Tame decompositions and collisions
• Title not available (Why is that?)
• Algorithms for the Functional Decomposition of Laurent Polynomials
• Functional decomposition of polynomials: the tame case
• Polynomial decompositions in polynomial time

This page was built for publication: Polynomial decomposition algorithms

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