Pages that link to "Item:Q5920628"

The following pages link to Algorithms in real algebraic geometry (Q5920628):

Displaying 50 items.

• Highly symmetric POVMs and their informational power (Q265425) (← links)
• Geometric permutations of non-overlapping unit balls revisited (Q265727) (← links)
• Continuous amortization and extensions: with applications to bisection-based root isolation (Q277222) (← links)
• Formally-verified decision procedures for univariate polynomial computation based on Sturm's and Tarski's theorems (Q287269) (← links)
• Fraction-free unit circle stability tests (Q305053) (← links)
• Metric properties of semialgebraic mappings (Q309643) (← links)
• Space exploration via proximity search (Q312150) (← links)
• Solving bivariate systems using rational univariate representations (Q325154) (← links)
• Polynomial-time approximation schemes for circle and other packing problems (Q329299) (← links)
• Bounding the equivariant Betti numbers of symmetric semi-algebraic sets (Q340423) (← links)
• On the solvability of derived matrix problems, including completions and duals (Q347496) (← links)
• Random generation of periodic hard ellipsoids based on molecular dynamics: a computationally-efficient algorithm (Q348151) (← links)
• Real ideal and the duality of semidefinite programming for polynomial optimization (Q351462) (← links)
• Semi-algebraic functions have small subdifferentials (Q359626) (← links)
• A constructive algebraic strategy for interpolatory subdivision schemes induced by bivariate box splines (Q360471) (← links)
• An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination (Q384995) (← links)
• Alternating projections on nontangential manifolds (Q387545) (← links)
• Exact symbolic-numeric computation of planar algebraic curves (Q387800) (← links)
• On real one-sided ideals in a free algebra (Q392410) (← links)
• Revisiting Zariski main theorem from a constructive point of view (Q402421) (← links)
• 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)
• Uniqueness of equilibrium in the haber synthesis of ammonia (Q460874) (← links)
• Segregation of stability domains of the Hamilton nonlinear system (Q462047) (← links)
• A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set (Q464735) (← links)
• Divide and conquer roadmap for algebraic sets (Q464736) (← links)
• On homotopy types of limits of semi-algebraic sets and additive complexity of polynomials (Q466903) (← links)
• A nonparametric analysis of multi-product oligopolies (Q471318) (← links)
• Design of Marx generators as a structured eigenvalue assignment (Q472612) (← links)
• Exponentially more concise quantum recognition of non-RMM regular languages (Q473186) (← links)
• Separating linear forms and rational univariate representations of bivariate systems (Q480646) (← links)
• Quantifier elimination for a class of exponential polynomial formulas (Q480651) (← links)
• Separating inequalities for nonnegative polynomials that are not sums of squares (Q480684) (← links)
• A baby step-giant step roadmap algorithm for general algebraic sets (Q486687) (← links)
• Counting multijoints (Q490912) (← links)
• Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy (Q491087) (← links)
• Proving inequalities and solving global optimization problems via simplified CAD projection (Q492036) (← links)
• Curvature of Hessian manifolds (Q499506) (← links)
• Bound the number of limit cycles bifurcating from center of polynomial Hamiltonian system via interval analysis (Q508217) (← links)
• Bivariate triangular decompositions in the presence of asymptotes (Q512372) (← links)