Pages that link to "Item:Q272196"
From MaRDI portal
The following pages link to A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196):
Displaying 5 items.
- Multilinear polynomial systems: root isolation and bit complexity (Q1994888) (← links)
- Fast computation of generic bivariate resultants (Q1996880) (← links)
- Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one (Q2066949) (← links)
- Uniform Determinantal Representations (Q5349291) (← links)
- An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases (Q6650574) (← links)