Pages that link to "Item:Q6132642"
From MaRDI portal
The following pages link to Reducibility by means of almost polynomial functions (Q6132642):
Displaying 10 items.
- The total reducibility order of a polynomial in two variables (Q752765) (← links)
- On the reduced length of a polynomial with real coefficients (Q873783) (← links)
- A note on polynomial reduction (Q1314434) (← links)
- \(m\)-reducibility with upper and lower bounds for reducing functions (Q1566445) (← links)
- Associative idempotent nondecreasing functions are reducible (Q1731811) (← links)
- Poly-element equations reducible to moment problem for entire functions of class A (Q2399436) (← links)
- (Q3432524) (← links)
- A poly-algorithmic approach to simplifying elementary functions (Q4657297) (← links)
- Reducibility of polynomials of the form f(x)-g(y) (Q5534354) (← links)
- A solution for reducing the degree of polynomial composition functions using Faà di Bruno's formula and Fourier transform (Q6133368) (← links)