Pages that link to "Item:Q2254683"
From MaRDI portal
The following pages link to On the complexity of computing with planar algebraic curves (Q2254683):
Displayed 17 items.
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196) (← links)
- Continuous amortization and extensions: with applications to bisection-based root isolation (Q277222) (← links)
- Solving bivariate systems using rational univariate representations (Q325154) (← links)
- Computing real roots of real polynomials (Q491245) (← links)
- Bounds for polynomials on algebraic numbers and application to curve topology (Q2118214) (← links)
- Certified numerical real root isolation for bivariate nonlinear systems (Q2156364) (← links)
- Computing the topology of a plane or space hyperelliptic curve (Q2174086) (← links)
- Separation bounds for polynomial systems (Q2188979) (← links)
- Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems (Q2211202) (← links)
- On the complexity of quadratic programming with two quadratic constraints (Q2364486) (← links)
- On the complexity of computing the topology of real algebraic space curves (Q2661918) (← links)
- The electrostatic equilibrium problem for classical discrete orthogonal polynomials (Q5879120) (← links)
- Algorithm for Connectivity Queries on Real Algebraic Curves (Q6060394) (← links)
- On Isolating Roots in a Multiple Field Extension (Q6081956) (← links)
- p-adic algorithm for bivariate Gröbner bases (Q6081975) (← links)
- Counting solutions of a polynomial system locally and exactly (Q6170809) (← links)
- Avoiding the general position condition when computing the topology of a real algebraic plane curve defined implicitly (Q6178879) (← links)