Pages that link to "Item:Q2365423"
From MaRDI portal
The following pages link to Semi-algebraic complexity of quotients and sign determination of remainders (Q2365423):
Displaying 8 items.
- Computational schemes for subresultant chains (Q831961) (← links)
- Verification complexity of linear prime ideals (Q1207526) (← links)
- On the parallel complexity of the polynomial ideal membership problem (Q1271168) (← links)
- Semi-algebraic complexity -- Additive complexity of matrix computational tasks (Q1361878) (← links)
- An elementary approach to subresultants theory. (Q1401153) (← links)
- A Lower Bound on the Complexity of Division in Finite Extension Fields and Inversion in Quadratic Alternative Algebras (Q3835017) (← links)
- (Q4361549) (← links)
- (Q5092469) (← links)