Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,360,596 papers from all fields of science
Search
Sign In
Create Free Account
Polynomial decomposition
Known as:
Composite polynomial
, Ritt's polynomial decomposition theorem
In mathematics, a polynomial decomposition expresses a polynomial f as the functional composition of polynomials g and h, where g and h have degree…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
10 relations
Computer algebra system
Degree of a polynomial
Factorization of polynomials
Horner's method
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Non-uniform directional dictionary-based limited feedback for massive MIMO systems
Panos N. Alevizos
,
Xiao Fu
,
N. Sidiropoulos
,
Ye Yang
,
A. Bletsas
International Symposium on Modeling and…
2017
Corpus ID: 20081091
This work proposes a new limited feedback channel estimation framework. The proposed approach exploits a sparse representation of…
Expand
2014
2014
Decomposing multivariate polynomials with structured low-rank matrix completion
K. Usevich
2014
Corpus ID: 36412046
We are focused on numerical methods for decomposing a multivariate polynomial as a sum of univariate polynomials in linear forms…
Expand
2014
2014
AN ALGORITHM FOR FACTORING COMPOSITE POLYNOMIALP(x p x )
S. Abrahamyan
,
K. Kyuregyan
2014
Corpus ID: 125088248
LetP(x) = x n +an 1x n 1 + +a1x+a0 be an irreducible polynomial overFq. In (Cao, 2012, Varshamov, 1973, Lidl, 1987) the…
Expand
2012
2012
The Hosoya Polynomial Decomposition for Polyphenyl Chains
Xianyong Li
,
Guoping Wang
,
H. Bian
,
Rongwei Hu
2012
Corpus ID: 124769864
For a graph G =( V, E) we denote by dG(u, v) the dis- tance between vertices u and v in G, and the Hosoya polynomial of G is…
Expand
2008
2008
A comparison of some methods for bounding connected and disconnected solution sets of interval linear systems
R. Kearfott
Computing
2008
Corpus ID: 8667388
SummaryFinding bounding sets to solutions to systems of algebraic equations with uncertainties in the coefficients, as well as…
Expand
2008
2008
Decomposition of ordinary differential polynomials
X. Gao
,
Mingbo Zhang
Applicable Algebra in Engineering, Communication…
2008
Corpus ID: 339144
In this paper, we present a complete algorithm to decompose nonlinear differential polynomials in one variable and with…
Expand
2006
2006
An Improvement Algorithm for Safety-Critical Software
D. Needham
,
Sean Jones
Software Engineering Research and Practice
2006
Corpus ID: 11553828
Analysis of software fault trees provides insight on improving safety throughout early phases of a system's development. Although…
Expand
2005
2005
Polynomial algorithms in computer algebra
F. Winkler
Applicable Algebra in Engineering, Communication…
2005
Corpus ID: 36578761
The best ebooks about Polynomial Algorithms In Computer Algebra that you can get for free here by download this Polynomial…
Expand
Review
2005
Review
2005
ON PRECONDITIONERS AND SPLITTING IN THE INTERVAL GAUSS – SEIDEL METHOD
R. B. Kearfott
,
Siriporn Hongthong
2005
Corpus ID: 10657098
Finding bounding sets to solutions to systems of algebraic equations with uncertainties in the coefficients, as well as finding…
Expand
2000
2000
Rank order polynomial decomposition for medical image compression
R. Grueter
,
O. Egger
,
J. Vesin
,
M. Kunt
2000
Corpus ID: 117003400
Keywords: LTS1 Reference LTS-ARTICLE-2000-014 Record created on 2006-06-14, modified on 2016-08-08