Tame decompositions and collisions
From MaRDI portal
Publication:5925210
DOI10.1016/j.jsc.2015.11.017zbMath1338.11104OpenAlexW1920316803MaRDI QIDQ5925210
Publication date: 11 February 2016
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2015.11.017
finite fieldscomputer algebracombinatorics on polynomialsRitt's second theoremcounting special polynomialstame polynomial decomposition
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)
Related Items (2)
Counting decomposable polynomials with integer coefficients ⋮ Counting invariant subspaces and decompositions of additive polynomials
Uses Software
Cites Work
- Composite rational functions expressible with few terms
- Decomposition of algebraic functions
- Functional decomposition of polynomials: the tame case
- Functional decomposition of polynomials: the wild case
- On composite lacunary polynomials and the proof of a conjecture of Schinzel
- Solvability by radicals is in polynomial time
- Edge-disjoint spanning trees and depth-first search
- Prime and composite polynomials
- Normal form for Ritt's second theorem
- Invariant varieties for polynomial dynamical systems
- On Ritt's decomposition theorem in the case of finite fields
- Building counterexamples to generalizations for rational functions of Ritt's decomposition theorem
- On the invariance of chains of fields
- Composite rational functions having a bounded number of zeros and poles
- Ritt's Second Theorem in arbitrary characteristic.
- On the number of terms of a composite polynomial
- Key Exchange and Encryption Schemes Based on Non-commutative Skew Polynomials
- Addendum to the paper: ``On the number of terms of a composite polynomial (Acta Arith. 127 (2007), 157–167)
- Sur la composition des polynômes
- Exponential Sums and Lattice Points III
- A polynomial time algorithm for computing all minimal decompositions of a polynomial
- Counting Decomposable Univariate Polynomials
- Polynomial Substitutions
- Composite Polynomials with Coefficients in an Arbitrary Field of Characteristic Zero
- Polynomial decomposition algorithms
- Tame decompositions and collisions
- Polynomial decomposition algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Tame decompositions and collisions
