Pages that link to "Item:Q2985830"
From MaRDI portal
The following pages link to On the Bit Complexity of Solving Bilinear Polynomial Systems (Q2985830):
Displaying 10 items.
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196) (← links)
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method (Q432769) (← links)
- Message length effects for solving polynomial systems on a hypercube (Q1121641) (← links)
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization (Q1690788) (← links)
- Multilinear polynomial systems: root isolation and bit complexity (Q1994888) (← links)
- Bit-complexity of solving systems of linear evolutionary partial differential equations (Q2117092) (← links)
- Analysis of the binary complexity of asymptotically fast algorithms for linear system solving (Q3806671) (← links)
- Koszul-Type Determinantal Formulas for Families of Mixed Multilinear Systems (Q5157586) (← links)
- A Non-2-step Nilsystem With Linear Polynomial Complexity (Q5497990) (← links)
- On the complexity of solving generic overdetermined bilinear systems (Q6163795) (← links)