The following pages link to Mohab Safey El Din (Q247236):
Displaying 50 items.
- (Q162069) (redirect page) (← links)
- On the complexity of the generalized MinRank problem (Q390388) (← links)
- Global optimization of polynomials restricted to a smooth variety using sums of squares (Q412217) (← links)
- Variant quantifier elimination (Q420753) (← links)
- A baby step-giant step roadmap algorithm for general algebraic sets (Q486687) (← links)
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity (Q629349) (← links)
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface (Q629823) (← links)
- Properness defects and projections and computation of at least one point in each connected component of a real algebraic set (Q705131) (← links)
- Real root finding for determinants of linear matrices (Q898255) (← links)
- The Voronoi diagram of three lines (Q1028584) (← links)
- New structure theorem for subresultants (Q1569836) (← links)
- Polynomial interrupt timed automata (Q1675144) (← links)
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization (Q1690788) (← links)
- Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials (Q1733314) (← links)
- Real solving for positive dimensional systems. (Q1867000) (← links)
- Homotopy techniques for solving sparse column support determinantal polynomial systems (Q1979422) (← links)
- On exact Reznick, Hilbert-Artin and Putinar's representations (Q2029015) (← links)
- Complete singularity analysis for the perspective-four-point problem (Q2054397) (← links)
- Guessing Gröbner bases of structured ideals of relations of sequences (Q2066951) (← 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)
- Computing real radicals and \(S\)-radicals of polynomial systems (Q2200311) (← links)
- Solving determinantal systems using homotopy techniques (Q2229744) (← links)
- Exact algorithms for semidefinite programs with degenerate feasible set (Q2229751) (← links)
- Intrinsic complexity estimates in polynomial optimization (Q2251913) (← links)
- On the geometry of polar varieties (Q2267371) (← links)
- Testing sign conditions on a multivariate polynomial and applications (Q2465578) (← links)
- Polynomial interrupt timed automata: verification and expressiveness (Q2662502) (← links)
- Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics (Q2674013) (← links)
- Probabilistic Algorithm for Computing the Dimension of Real Algebraic Sets (Q2819735) (← links)
- Optimizing a Parametric Linear Function over a Non-compact Real Algebraic Variety (Q2819759) (← links)
- Real Root Finding for Rank Defects in Linear Hankel Matrices (Q2819761) (← links)
- Exact Algorithms for Linear Matrix Inequalities (Q2834563) (← links)
- Variant real quantifier elimination (Q2883815) (← links)
- Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set (Q2934480) (← links)
- Global optimization of polynomials using generalized critical values and sums of squares (Q2946528) (← links)
- Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology (Q2946547) (← links)
- On the complexity of computing gröbner bases for quasi-homogeneous systems (Q2963233) (← links)
- Computing rational solutions of linear matrix inequalities (Q2963234) (← links)
- Determinantal Sets, Singularities and Application to Optimal Control in Medical Imagery (Q2985814) (← links)
- Critical Point Computations on Smooth Varieties (Q2985826) (← links)
- Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions (Q3083312) (← links)
- A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets (Q3177875) (← links)
- Computing necessary integrability conditions for planar parametrized homogeneous potentials (Q3452379) (← links)
- (Q3568151) (← links)
- Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping (Q3597979) (← links)
- (Q3602882) (← links)
- (Q4531853) (← links)
