Pages that link to "Item:Q5920628"
From MaRDI portal
The following pages link to Algorithms in real algebraic geometry (Q5920628):
Displayed 50 items.
- Computing isolated roots of sparse polynomial systems in affine space (Q410703) (← links)
- Refined bounds on the number of connected components of sign conditions on a variety (Q411399) (← links)
- Sphere and dot product representations of graphs (Q411410) (← links)
- Faster \(p\)-adic feasibility for certain multivariate sparse polynomials (Q412210) (← links)
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane (Q412277) (← links)
- Root isolation of zero-dimensional polynomial systems with linear univariate representation (Q420751) (← links)
- Variant quantifier elimination (Q420753) (← links)
- Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian (Q423886) (← links)
- Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces (Q431820) (← links)
- Real radical initial ideals (Q435959) (← links)
- Computational geometry of positive definiteness (Q445814) (← links)
- Geodesic diameter of sets defined by few quadratic equations and inequalities (Q455654) (← links)
- An algebraic certificate for Budan's theorem (Q531342) (← links)
- An algebraic approach to continuous collision detection for ellipsoids (Q543838) (← links)
- Solution formulas for cubic equations without or with constraints (Q548598) (← links)
- Applications of dimensionality reduction and exponential sums to graph automorphism (Q551192) (← links)
- A deterministic algorithm for isolating real roots of a real polynomial (Q607163) (← links)
- Tight bounds for rational sums of squares over totally real fields (Q619610) (← links)
- Representing simple \(d\)-dimensional polytopes by \(d\) polynomials (Q623364) (← links)
- A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces (Q625206) (← links)
- Solving the implicitization, inversion and reparametrization problems for rational curves through subresultants (Q625247) (← links)
- Arrangements on parametric surfaces. II: Concretizations and applications (Q626976) (← links)
- CAD and topology of semi-algebraic sets (Q626978) (← links)
- On the topology of real algebraic plane curves (Q626980) (← links)
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface (Q629823) (← links)
- Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\) (Q633624) (← links)
- An algorithm for determining copositive matrices (Q636239) (← links)
- Linear solving for sign determination (Q638542) (← links)
- Solving parametric piecewise polynomial systems (Q651936) (← links)
- The dimension of semialgebraic subdifferential graphs (Q654064) (← links)
- A note on the complexity of real algebraic hypersurfaces (Q659701) (← links)
- On the complexity of minimizing probabilistic and quantum automata (Q690502) (← links)
- Evaluating geometric queries using few arithmetic operations (Q694567) (← links)
- Some new results on decidability for elementary algebra and geometry (Q714712) (← links)
- A worst-case bound for topology computation of algebraic curves (Q765857) (← links)
- Multi-letter quantum finite automata: decidability of the equivalence and minimization of states (Q766174) (← links)
- Semidefinite programming and sums of Hermitian squares of noncommutative polynomials (Q847674) (← links)
- Stabbing simplices by points and flats (Q848667) (← links)
- Computing the top Betti numbers of semialgebraic sets defined by quadratic inequalities in polynomial time (Q937274) (← links)
- A sharper estimate on the Betti numbers of sets defined by quadratic inequalities (Q938303) (← links)
- Certificates of positivity in the Bernstein basis (Q938310) (← links)
- Improving the topology computation of an arrangement of cubics (Q945944) (← links)
- Bounding the Betti numbers and computing the Euler-Poincaré characteristic of semi-algebraic sets defined by partly quadratic systems of polynomials (Q967467) (← links)
- A parametric representation of totally mixed Nash equilibria (Q979929) (← links)
- An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions (Q987564) (← links)
- Sturm and Sylvester algorithms revisited via tridiagonal determinantal representations (Q989047) (← links)
- On the intrinsic complexity of point finding in real singular hypersurfaces (Q990944) (← links)
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals (Q998976) (← links)
- On the number of topological types occurring in a parameterized family of arrangements (Q1006392) (← links)
- Computing the Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials (Q1024388) (← links)