Pages that link to "Item:Q4336106"
From MaRDI portal
The following pages link to The Space Complexity of Elimination Theory: Upper Bounds (Q4336106):
Displaying 6 items.
- On a generalization of Stickelberger's theorem (Q607067) (← links)
- Properness defects of projection and minimal discriminant variety (Q719760) (← links)
- Computing the characteristic polynomial of multivariate polynomial matrices given by straight-line programs (Q1404687) (← links)
- The real dimension problem is \(\text{NP}_{\mathbb R}\)-complete. (Q1974570) (← links)
- Descriptive complexity of deterministic polylogarithmic time and space (Q2662676) (← links)
- Computing Circuit Polynomials in the Algebraic Rigidity Matroid (Q6161559) (← links)
