On the bit complexity of solving bilinear polynomial systems
From MaRDI portal
Recommendations
- Multilinear polynomial systems: root isolation and bit complexity
- On the complexity of solving a bivariate polynomial system
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- On the complexity of solving generic overdetermined bilinear systems
- On the complexity of real solving bivariate systems
Cited in
(10)- Message length effects for solving polynomial systems on a hypercube
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
- Multilinear polynomial systems: root isolation and bit complexity
- Bit-complexity of solving systems of linear evolutionary partial differential equations
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
- Analysis of the binary complexity of asymptotically fast algorithms for linear system solving
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
- Koszul-type determinantal formulas for families of mixed multilinear systems
- A Non-2-step Nilsystem With Linear Polynomial Complexity
- On the complexity of solving generic overdetermined bilinear systems
This page was built for publication: On the bit complexity of solving bilinear polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2985830)
