Pages that link to "Item:Q2985822"
From MaRDI portal
The following pages link to On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection (Q2985822):
Displaying 9 items.
- Fast algorithms for zero-dimensional polynomial systems using duality (Q1422204) (← links)
- On the bit complexity of polynomial system solving (Q1734694) (← links)
- An algebraic framework for computing the topology of offsets to rational curves (Q2357689) (← links)
- (Q3447182) (← links)
- On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials (Q3831940) (← links)
- Strong $\mu$-Bases for Rational Tensor Product Surfaces and Extraneous Factors Associated to Bad Base Points and Anomalies at Infinity (Q5283251) (← links)
- Counting solutions of a polynomial system locally and exactly (Q6170809) (← links)
- On the complexity of Chow and Hurwitz forms (Q6536635) (← links)
- Computing the non-properness set of real polynomial maps in the plane (Q6672004) (← links)
