Pages that link to "Item:Q5920628"
From MaRDI portal
The following pages link to Algorithms in real algebraic geometry (Q5920628):
Displayed 50 items.
- 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)
- A systematic approach for doing an a priori identifiability study of dynamical nonlinear models (Q669172) (← links)
- Tractability conditions for numeric CSPs (Q683751) (← 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 Szemerédi-Trotter type theorem in \(\mathbb R^4\) (Q745661) (← links)
- Stress matrices and global rigidity of frameworks on surfaces (Q745663) (← links)
- Quadratic growth and critical point stability of semi-algebraic functions (Q747778) (← links)
- On QE algorithms over an algebraically closed field based on comprehensive Gröbner systems (Q748755) (← 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)
- Algebraic varieties are homeomorphic to varieties defined over number fields (Q784197) (← links)
- Derandomization and absolute reconstruction for sums of powers of linear forms (Q820536) (← links)
- A new general formula for the Cauchy index on an interval with subresultants (Q820980) (← links)
- Measuring the local non-convexity of real algebraic curves (Q820982) (← links)
- Measuring the constrained reachability in quantum Markov chains (Q824285) (← links)
- Interpolation and model checking for nonlinear arithmetic (Q832268) (← links)
- Semidefinite programming and sums of Hermitian squares of noncommutative polynomials (Q847674) (← links)
- Stabbing simplices by points and flats (Q848667) (← links)
- Incidence bounds on multijoints and generic joints (Q894681) (← links)
- Semi-algebraic Ramsey numbers (Q896011) (← links)
- Nearly optimal refinement of real roots of a univariate polynomial (Q898253) (← links)
- Real root finding for determinants of linear matrices (Q898255) (← links)
- Computing the Fréchet distance between folded polygons (Q904083) (← links)
- Application of Sturm theorem in the global controllability of a class of high dimensional polynomial systems (Q905141) (← 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)
- On the asymptotic and practical complexity of solving bivariate systems over the reals (Q1025391) (← links)
- An efficient algorithm for the stratification and triangulation of an algebraic surface (Q1037650) (← links)
- Computing the topology of an arrangement of implicitly defined real algebraic plane curves (Q1045532) (← links)
- Auxetic deformations and elliptic curves (Q1647847) (← links)
- A transfer method from bounded existential Diophantine equations to Tarski algebra formulas (Q1686076) (← links)
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization (Q1690788) (← links)
- Source localization and denoising: a perspective from the TDOA space (Q1697950) (← links)
- Matroids over partial hyperstructures (Q1711930) (← links)