Pages that link to "Item:Q6163795"
From MaRDI portal
The following pages link to On the complexity of solving generic overdetermined bilinear systems (Q6163795):
Displaying 3 items.
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity (Q629349) (← links)
- Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gröbner bases (Q2204858) (← links)
- On the Bit Complexity of Solving Bilinear Polynomial Systems (Q2985830) (← links)