Pages that link to "Item:Q5002654"
From MaRDI portal
The following pages link to On some computations on sparse polynomials (Q5002654):
Displaying 16 items.
- Sparse power series and parameterized linear operators (Q557518) (← links)
- On a sequence of sparse binomial-type polynomials (Q691817) (← links)
- Fast construction of constant bound functions for sparse polynomials (Q1029674) (← links)
- Algorithms for computing sparse shifts for multivariate polynomials (Q1583886) (← links)
- Sparse resultant of composed polynomials. I: Mixed-unmixed case. (Q1600042) (← links)
- Bernstein's second theorem and Viro's method for sparse polynomial systems in chemistry (Q1775738) (← links)
- A theory and an algorithm for computing sparse multivariate polynomial remainder sequence (Q1798335) (← links)
- Sparse shifts for univariate polynomials (Q1924546) (← links)
- New bounds and an efficient algorithm for sparse difference resultants (Q2029018) (← links)
- Binomiality testing and computing sparse polynomials via witness sets (Q2155632) (← links)
- Sparse squares of polynomials (Q2759109) (← links)
- Polynomials whose powers are sparse (Q3353091) (← links)
- (Q4227280) (← links)
- Efficiently Computing Real Roots of Sparse Polynomials (Q5119944) (← links)
- Sparse multiplication for skew polynomials (Q5145973) (← links)
- Complexity of sparse polynomial solving 2: renormalization (Q6171578) (← links)
