Pages that link to "Item:Q657656"
From MaRDI portal
The following pages link to Bit-size estimates for triangular sets in positive dimension (Q657656):
Displaying 7 items.
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196) (← links)
- Algorithms for computing triangular decomposition of polynomial systems (Q413407) (← links)
- Complexity results for triangular sets (Q1878489) (← links)
- On the complexity of computing with zero-dimensional triangular sets (Q1930161) (← links)
- Usage of modular techniques for efficient computation of ideal operations (Q1993362) (← 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)