Pages that link to "Item:Q1930161"
From MaRDI portal
The following pages link to On the complexity of computing with zero-dimensional triangular sets (Q1930161):
Displaying 16 items.
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196) (← links)
- Modular composition modulo triangular sets and applications (Q371190) (← links)
- Homotopy techniques for multiplication modulo triangular sets (Q651881) (← links)
- Fast arithmetic for triangular sets: from theory to practice (Q1025397) (← links)
- Complexity results for triangular sets (Q1878489) (← links)
- Computing Puiseux series: a fast divide and conquer algorithm (Q2077183) (← links)
- Computing critical points for invariant algebraic systems (Q2100065) (← links)
- Real root finding for low rank linear matrices (Q2175227) (← links)
- Directed evaluation (Q2192677) (← links)
- Computing real radicals and \(S\)-radicals of polynomial systems (Q2200311) (← links)
- Block-Krylov techniques in the context of sparse-FGLM algorithms (Q2284956) (← links)
- Accelerated tower arithmetic (Q2338646) (← links)
- Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences (Q2628309) (← links)
- On the complexity exponent of polynomial system solving (Q2658549) (← links)
- On the Bit-Size of Non-radical Triangular Sets (Q4628495) (← links)
- Decomposition of polynomial sets into characteristic pairs (Q4960083) (← links)