Pages that link to "Item:Q5920628"
From MaRDI portal
The following pages link to Algorithms in real algebraic geometry (Q5920628):
Displayed 50 items.
- Atypical points at infinity and algorithmic detection of the bifurcation locus of real polynomials (Q2043085) (← links)
- First-order orbit queries (Q2048201) (← links)
- The impact on the properties of the EFGM copulas when extending this family (Q2049225) (← links)
- Correction to: ``Tropical varieties for exponential sums'' (Q2049974) (← links)
- The set of separable states has no finite semidefinite representation except in dimension \(3\times 2\) (Q2050062) (← links)
- On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond (Q2051775) (← links)
- Sampling polynomial trajectories for LTL verification (Q2055964) (← links)
- Revisiting reachability in polynomial interrupt timed automata (Q2059890) (← links)
- Subset selection for matrices with fixed blocks (Q2066125) (← links)
- On tameness of zonoids (Q2066279) (← links)
- On algorithms testing positivity of real symmetric polynomials (Q2072924) (← links)
- An algebraic method to fidelity-based model checking over quantum Markov chains (Q2084946) (← links)
- On the equality of periods of Kontsevich-Zagier (Q2086407) (← links)
- Vandermonde varieties, mirrored spaces, and the cohomology of symmetric semi-algebraic sets (Q2088135) (← links)
- Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model (Q2096389) (← links)
- Interactions of zeros of polynomials and multiplicity matrices (Q2097243) (← links)
- Smooth points on semi-algebraic sets (Q2100053) (← links)
- Computing critical points for invariant algebraic systems (Q2100065) (← links)
- Half-trek criterion for identifiability of latent variable models (Q2112804) (← links)
- Quantitative curve selection lemma (Q2114147) (← links)
- Solving parametric systems of polynomial equations over the reals through Hermite matrices (Q2117425) (← links)
- Bounds for polynomials on algebraic numbers and application to curve topology (Q2118214) (← links)
- Model checking QCTL plus on quantum Markov chains (Q2123051) (← links)
- Gröbner bases and critical values: the asymptotic combinatorics of determinantal systems (Q2132458) (← links)
- Level lines of a polynomial on a plane (Q2132546) (← links)
- High-order quadrature on multi-component domains implicitly defined by multivariate polynomials (Q2134493) (← links)
- Disguised toric dynamical systems (Q2134666) (← links)
- When a system of real quadratic equations has a solution (Q2143674) (← links)
- Describing amoebas (Q2148929) (← links)
- Complexity of linear relaxations in integer programming (Q2149550) (← links)
- Algebraic degrees of 3-dimensional polytopes (Q2155626) (← links)
- An approximate characterisation of the set of feasible trajectories for constrained flat systems (Q2165988) (← links)
- On the Reeb spaces of definable maps (Q2167309) (← links)
- On generalizing Descartes' rule of signs to hypersurfaces (Q2172219) (← links)
- Real root finding for low rank linear matrices (Q2175227) (← links)
- Numerical roadmap of smooth bounded real algebraic surface (Q2180637) (← links)
- Generically globally rigid graphs have generic universally rigid frameworks (Q2182252) (← links)
- Separation bounds for polynomial systems (Q2188979) (← links)
- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location (Q2189742) (← links)
- Tropical combinatorial Nullstellensatz and sparse polynomials (Q2194772) (← links)
- On \(\epsilon\)-sensitive monotone computations (Q2198153) (← links)
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications (Q2207601) (← links)
- Invariance of a class of semi-algebraic sets for polynomial systems with dynamic compensators (Q2208563) (← links)
- Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems (Q2211202) (← links)
- Parameterization of a set determined by the generalized discriminant of a polynomial (Q2216869) (← links)
- Computation of the fundamental units of number rings using a generalized continued fraction (Q2216908) (← links)
- Equivalence checking of quantum finite-state machines (Q2220441) (← links)
- A condition for multiplicity structure of univariate polynomials (Q2229732) (← links)
- Exact algorithms for semidefinite programs with degenerate feasible set (Q2229751) (← links)
- On the sensitivity of the optimal partition for parametric second-order conic optimization (Q2230950) (← links)