Mohab Safey El Din
ABSTRACT
No abstract available.
- S. Arora, R. Ge, R. Kannan, and A. Moitra. Computing a nonnegative matrix factorization-provably. In Proc. STOC'12, pp. 145-162. ACM, 2012. Google Scholar
Digital Library
- C. Bajaj. Some applications of constructive real algebraic geometry. Springer, 1994.Google ScholarCross Ref
- B. Bank, M. Giusti, J. Heintz, and G.-M. Mbakop. Polar varieties and efficient real equation solving: the hypersurface case. J. Complexity, 13(1):5-27, 1997. Google ScholarDigital Library
- B. Bank, M. Giusti, J. Heintz, and L.-M. Pardo. Generalized polar varieties: geometry and algorithms. J. Complexity, 21(4):377-412, 2005. Google ScholarDigital Library
- B. Bank, M. Giusti, J. Heintz, M. Safey El Din, and E. Schost. On the geometry of polar varieties. Applicable Algebra in Engineering, Communication and Computing, 2010. Google ScholarDigital Library
- S. Basu, R. Pollack, and M.-F. Roy. On the combinatorial and algebraic complexity of quantifier elimination. J. ACM, 43(6):1002-1045, Nov. 1996. Google ScholarDigital Library
- S. Basu, R. Pollack, and M.-F. Roy. A new algorithm to find a point in every cell defined by a family of polynomials. In Quantifier elimination and cylindrical algebraic decomposition. Springer-Verlag, 1998.Google Scholar
- S. Basu, R. Pollack, and M.-F. Roy. Computing roadmaps of semi-algebraic sets on a variety. J. AMS, 3(1):55-82, 1999.Google Scholar
- S. Basu, R. Pollack, and M.-F. Roy. Algorithms in real algebraic geometry, volume 10 of Algorithms and Computation in Mathematics. Springer-Verlag, second edition, 2006. Google ScholarDigital Library
- S. Basu, M.-F. Roy, M. Safey El Din, and E. Schost. A baby-step giant-step roadmap algorithm for general real algebraic sets. submitted to Foundations of Computational Mathematics, 2012.Google Scholar
- V. D. Blondel. Simultaneous stabilization of linear systems and interpolation with rational functions. In Open problems in mathematical systems and control theory, pp. 53-59. Springer, 1999.Google ScholarCross Ref
- J. Canny. The complexity of robot motion planning. PhD thesis, MIT, 1987.Google Scholar
- G. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decompostion. In Automata Theory and Formal Languages, pp. 134-183. Springer, 1975. Google Scholar
- J.-C. Faugère, M. Safey El Din, and P.-J. Spaenlehauer. Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1, 1): Algorithms and complexity. J. Symb. Comput., 46(4):406-437, 2011. Google ScholarDigital Library
- J.-C. Faugère, M. Safey El Din, and P.-J. Spaenlehauer. Critical points and Gröbner bases: the unmixed case. ISSAC'12, pp. 162-169. ACM, 2012. Google ScholarDigital Library
- M. Giusti and J. Heintz. La détermination de la dimension et des points isolées d'une variété algébrique peuvent s'effectuer en temps polynomial. In Computational Algebraic Geometry and Commutative Algebra, Cortona, volume 34, pp. 216-256, 1991.Google Scholar
- M. Giusti, G. Lecerf, and B. Salvy. A Gröbner-free alternative for polynomial system solving. J. Complexity, 17(1):154-211, 2001. Google ScholarDigital Library
- K. A. Hansen, M. Koucky, N. Lauritzen, P. B. Miltersen, and E. P. Tsigaridas. Exact algorithms for solving stochastic games. In Proc. STOC'11, pp. 205-214. ACM, 2011. Google ScholarDigital Library
- G. Jeronimo, D. Perrucci, and J. Sabia. On sign conditions over real multivariate polynomials. Discrete Comput. Geom., 44(1):195-222, 2010.Google ScholarDigital Library
- Q. Jin and T. Yang. Overconstraint analysis on spatial 6-link loops. Mechanism and machine theory, 37(3):267-278, 2002.Google Scholar
- P. Koiran. Randomized and deterministic algorithms for the dimension of algebraic varieties. In Proc. 38th Annual Symposium on Foundations of Computer Science., pp. 36-45. IEEE, 1997. Google ScholarDigital Library
- P. Koiran. The Real Dimension Problem is NPR-complete. J. Complexity, 15(2):227-238, 1999. Google ScholarDigital Library
- M. Safey El Din. Testing sign conditions on a multivariate polynomial and applications. Mathematics in Computer Science, 1(1):177-207, December 2007.Google ScholarCross Ref
- M. Safey El Din and E. Schost. Polar varieties and computation of one point in each connected component of a smooth real algebraic set. In ISSAC'03, pp. 224-231. ACM, 2003. Google ScholarDigital Library
- M. Safey El Din and E. Schost. A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface. Discrete Comput. Geom., 45(1):181-220, 2011. Google ScholarDigital Library
- M. Safey El Din and E. Tsigaridas. A probabilistic algorithm to compute the real dimension of a semi-algebraic set. ArXiv 1304.1928, Apr. 2013.Google Scholar
- J. Solymosi and T. Tao. An incidence theorem in higher dimensions. Discrete Comput. Geom., pp. 1-26, 2012. Google ScholarDigital Library
- N. Vorobjov. Complexity of computing the local dimension of a semi-algebraic set. J. Symb. Comput., 27(6):565-579, 1999. Google ScholarDigital Library
Index Terms
- Critical point methods and effective real algebraic geometry: new results and trends
Recommendations
Computing the real isolated points of an algebraic hypersurface
ISSAC '20: Proceedings of the 45th International Symposium on Symbolic and Algebraic ComputationLet R be the field of real numbers. We consider the problem of computing the real isolated points of a real algebraic set in Rn given as the vanishing set of a polynomial system. This problem plays an important role for studying rigidity properties of ...
Numerically Computing Real Points on Algebraic Sets
Given a polynomial system f, a fundamental question is to determine if f has real roots. Many algorithms involving the use of infinitesimal deformations have been proposed to answer this question. In this article, we transform an approach of Rouillier, ...
Algorithm for Connectivity Queries on Real Algebraic Curves
ISSAC '23: Proceedings of the 2023 International Symposium on Symbolic and Algebraic ComputationWe consider the problem of answering connectivity queries on a real algebraic curve. The curve is given as the real trace of an algebraic curve, assumed to be in generic position, and being defined by some rational parametrizations. The query points ...
Comments