Pages that link to "Item:Q1878489"
From MaRDI portal
The following pages link to Complexity results for triangular sets (Q1878489):
Displaying 18 items.
- Modular composition modulo triangular sets and applications (Q371190) (← links)
- Relaxed Hensel lifting of triangular sets (Q480691) (← links)
- Optimization techniques for small matrix multiplication (Q533859) (← links)
- Bit-size estimates for triangular sets in positive dimension (Q657656) (← links)
- Properness defects of projection and minimal discriminant variety (Q719760) (← links)
- A new method for solving algebraic systems of positive dimension (Q1180160) (← links)
- Complexity of triangular representations of algebraic sets (Q1714872) (← links)
- On the complexity of computing with zero-dimensional triangular sets (Q1930161) (← links)
- Complexity of solving parametric polynomial systems (Q2256707) (← links)
- On approximate triangular decompositions in dimension zero (Q2470055) (← links)
- Change of order for regular chains in positive dimension (Q2476011) (← links)
- An application of regular chain theory to the study of limit cycles (Q2866055) (← links)
- On the Bit-Size of Non-radical Triangular Sets (Q4628495) (← links)
- (Q4660711) (← links)
- Modular equations for hyperelliptic curves (Q4821057) (← links)
- Irredundant Triangular Decomposition (Q5120211) (← links)
- Elimination of unknowns for systems of algebraic differential-difference equations (Q5141753) (← links)
- On computing absolutely irreducible components of algebraic varieties with parameters (Q5962004) (← links)