Pages that link to "Item:Q5926519"
From MaRDI portal
The following pages link to Numerical computation of the least common multiple of a set of polynomials (Q5926519):
Displaying 8 items.
- Approximate least common multiple of several polynomials using the ERES division algorithm (Q331163) (← links)
- Computing values of a polynomial with only few multiplications (Q1313709) (← links)
- Normal factorisation of polynomials and computational issues. (Q1416384) (← links)
- System theoretic based characterisation and computation of the least common multiple of a set of polynomials. (Q1430368) (← links)
- Computing the least common subsumer w.r.t. a background terminology (Q2372193) (← links)
- Numerical and Symbolical Methods for the GCD of Several Polynomials (Q2913160) (← links)
- On the Computation of the GCD of 2-D Polynomials (Q3089756) (← links)
- (Q3611039) (← links)