Pages that link to "Item:Q3177875"
From MaRDI portal
The following pages link to A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets (Q3177875):
Displaying 32 items.
- Real root finding for determinants of linear matrices (Q898255) (← links)
- Construction of roadmaps in semi-algebraic sets (Q1311619) (← links)
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization (Q1690788) (← links)
- Homotopy techniques for solving sparse column support determinantal polynomial systems (Q1979422) (← links)
- On exact Reznick, Hilbert-Artin and Putinar's representations (Q2029015) (← links)
- Bit complexity for computing one point in each connected component of a smooth real algebraic set (Q2100045) (← links)
- Computing critical points for invariant algebraic systems (Q2100065) (← links)
- Solving parametric systems of polynomial equations over the reals through Hermite matrices (Q2117425) (← links)
- Gröbner bases and critical values: the asymptotic combinatorics of determinantal systems (Q2132458) (← links)
- Real root finding for low rank linear matrices (Q2175227) (← links)
- Numerical roadmap of smooth bounded real algebraic surface (Q2180637) (← links)
- Computing real radicals and \(S\)-radicals of polynomial systems (Q2200311) (← links)
- Symmetric matrices whose entries are linear functions (Q2206413) (← links)
- Solving determinantal systems using homotopy techniques (Q2229744) (← links)
- Exact algorithms for semidefinite programs with degenerate feasible set (Q2229751) (← links)
- On types of degenerate critical points of real polynomial functions (Q2284966) (← links)
- Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus (Q2303419) (← links)
- Computing real witness points of positive dimensional polynomial systems (Q2357373) (← links)
- Solving rank-constrained semidefinite programs in exact arithmetic (Q2409017) (← links)
- Improved complexity bounds for counting points on hyperelliptic curves (Q2420634) (← links)
- \(N\)-dimensional versus \((N-1)\)-dimensional connectivity testing of first-order queries to semi-algebraic sets (Q2576661) (← links)
- Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics (Q2674013) (← links)
- A note on polynomial solvability of the CDT problem (Q2789609) (← links)
- Exact algorithms for linear matrix inequalities (Q2834563) (← links)
- (Q3983701) (← links)
- A Geometric Approach for Analyzing Parametric Biological Systems by Exploiting Block Triangular Structure (Q5090111) (← links)
- Complexity of deciding connectivity in real algebraic sets (Q5244507) (← links)
- Foreword (Q5918134) (← links)
- Refined F5 Algorithms for Ideals of Minors of Square Matrices (Q6081937) (← links)
- Computing roadmaps in unbounded smooth real algebraic sets. I: Connectivity results (Q6170822) (← links)
- On types of isolated KKT points in polynomial optimization (Q6594973) (← links)
- Faster one block quantifier elimination for regular polynomial systems of equations (Q6666546) (← links)
