Pages that link to "Item:Q1939330"
From MaRDI portal
The following pages link to On the complexity of the multivariate resultant (Q1939330):
Displaying 13 items.
- On the irreducibility of multivariate subresultants. (Q1426641) (← links)
- Sparse resultants and straight-line programs (Q1690776) (← links)
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization (Q1690788) (← links)
- Complexity classes and completeness in algebraic geometry (Q1740570) (← links)
- A note on testing the resultant (Q1908893) (← links)
- The characteristic polynomial of the complete 3-uniform hypergraph (Q2041782) (← links)
- Processing succinct matrices and vectors (Q2411035) (← links)
- An arithmetic Poisson formula for the multi-variate resultant (Q2441516) (← links)
- Complexity of constructing Dixon resultant matrix (Q3174885) (← links)
- (Q3398460) (← links)
- On the Complexity of Hybrid $n$ -Term Karatsuba Multiplier for Trinomials (Q5008364) (← links)
- (Q6041403) (← links)
- On the complexity of Chow and Hurwitz forms (Q6536635) (← links)