|
||
---|---|---|
inria-00070542v1
Reports
Computing Sampling Points on a Singular Real Hypersurface using Lagrange's System [Research Report] RR-5464, INRIA. 2005, pp.19 |
||
hal-01222572v1
Conference papers
Polynomial Interrupt Timed Automata The 9th Workshop on Reachability Problems (RP'15), Sep 2015, Warsaw, Poland. pp.20-32, ⟨10.1007/978-3-319-24537-9_3⟩ ![]() |
||
hal-01159210v2
Journal articles
Real root finding for low rank linear matrices Applicable Algebra in Engineering, Communication and Computing, Springer Verlag, 2020, 31, pp.101-133. ⟨10.1007/s00200-019-00396-w⟩ ![]() |
||
hal-01393022v3
Journal articles
SPECTRA – a Maple library for solving linear matrix inequalities in exact arithmetic Optimization Methods and Software, Taylor & Francis, 2019, 34 (1), pp.62-78. ⟨10.1080/10556788.2017.1341505⟩ |
||
hal-01184320v2
Journal articles
Exact algorithms for linear matrix inequalities SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2016, 26 (4), pp.2512-2539. ⟨10.1137/15M1036543⟩ |
||
hal-03070525v1
Journal articles
Complete Singularity Analysis for the Perspective-Four-Point Problem International Journal of Computer Vision, Springer Verlag, In press |
||
inria-00099962v1
Journal articles
Properness defects of projections and computation of at least one point in each connected component of a real algebraic set Discrete and Computational Geometry, Springer Verlag, 2004, 32 (3), pp.417-430. ⟨10.1007/s00454-004-1107-5⟩ ![]() |
||
inria-00099649v1
Conference papers
Polar varieties and computation of one point in each connected component of a smooth real algebraic set International Symposium on Symbolic and Algebraic Computation 2003 - ISSAC'2003, Aug 2003, Philadelphie, PA, United States. pp.224-231, ⟨10.1145/860854.860901⟩ |
||
inria-00071512v1
Reports
Strong Bi-homogeneous Bézout's Theorem and degree bounds for algebraic optimization [Research Report] RR-5071, INRIA. 2004 |
||
inria-00419983v1
Journal articles
Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2010, 20 (6), pp.2876-2889. ⟨10.1137/090772459⟩ |
||
hal-00744469v1
Conference papers
Deciding reachability of the infimum of a multivariate polynomial. ISSAC 2011 - 36th International Symposium on Symbolic and Algebraic Computation, Jun 2011, San Jose, United States. pp.131-138, ⟨10.1145/1993886.1993910⟩ |
||
inria-00359748v1
Journal articles
A baby steps/giant steps Monte Carlo algorithm for computing roadmaps in smooth compact real hypersurfaces Discrete and Computational Geometry, Springer Verlag, 2011, 45 (1), pp.181-220. ⟨10.1007/s00454-009-9239-2⟩ |
||
hal-00778365v1
Journal articles
Variant Quantifier Elimination Journal of Symbolic Computation, Elsevier, 2012, International Symposium on Symbolic and Algebraic Computation (ISSAC 2009), 47 (7), pp.883-901. ⟨10.1016/j.jsc.2011.05.014⟩ |
||
hal-00667494v1
Conference papers
Critical Points and Gröbner Bases: the Unmixed Case ISSAC 2012 - International Symposium on Symbolic and Algebraic Computation - 2012, Jul 2012, Grenoble, France. pp.162-169, ⟨10.1145/2442829.2442855⟩ ![]() |
||
inria-00105835v2
Reports
Testing Sign Conditions on a Multivariate Polynomial and Applications [Research Report] RR-5995, INRIA. 2006 |
||
hal-01657849v1
Journal articles
A lower bound on the positive semidefinite rank of convex bodies SIAM Journal on Applied Algebra and Geometry, Society for Industrial and Applied Mathematics 2018, 2 (1), pp.126-139. ⟨10.1137/17M1142570⟩ |
||
hal-01319729v2
Journal articles
Bit complexity for multi-homogeneous polynomial system solving Application to polynomial minimization Journal of Symbolic Computation, Elsevier, In press, 87, pp.176-206. ⟨10.1016/j.jsc.2017.08.001⟩ |
||
hal-01720612v1
Conference papers
On Exact Polya and Putinar's Representations ISSAC '18 International Symposium on Symbolic and Algebraic Computation, Jul 2018, New-York, United States. pp.279-286, ⟨10.1145/3208976.3208986⟩ ![]() |
||
hal-01819106v1
Conference papers
Real root finding for equivariant semi-algebraic systems ISSAC 20018 - 43rd International Symposium on Symbolic and Algebraic Computation, Jul 2018, New-York, United States |
||
hal-01935727v1
Preprints, Working Papers, ...
On Exact Reznick, Hilbert-Artin and Putinar's Representations 2018 ![]() |
||
hal-01956596v1
Conference papers
On the complexity of computing real radicals of polynomial systems ISSAC '18 - The 2018 ACM on International Symposium on Symbolic and Algebraic Computation, Jul 2018, New-York, United States. pp.351-358, ⟨10.1145/3208976.3209002⟩ |
||
hal-01956812v1
Journal articles
RealCertify: a Maple package for certifying non-negativity ACM Communications in Computer Algebra, Association for Computing Machinery (ACM), 2018, 52 (2), pp.34-37. ⟨10.1145/3282678.3282681⟩ ![]() |
||
hal-01152751v1
Conference papers
Probabilistic Algorithm for Computing the Dimension of Real Algebraic Sets ISSAC'15 - 40th International Symposium on Symbolic and Algebraic Computation, Jul 2015, Bath, United Kingdom. pp.37-44, ⟨10.1145/2755996.2756670⟩ |
||
hal-01538729v1
Journal articles
Algorithms for Weighted Sums of Squares Decomposition of Non-negative Univariate Polynomials Journal of Symbolic Computation, Elsevier, 2019, 93, pp.200-220. ⟨10.1016/j.jsc.2018.06.005⟩ |
||
hal-02110556v1
Conference papers
Computing the volume of compact semi-algebraic sets ISSAC 2019 - International Symposium on Symbolic and Algebraic Computation, Jul 2019, Beijing, China |
||
hal-02388168v1
Journal articles
Computing real radicals and S-radicals of polynomial systems Journal of Symbolic Computation, Elsevier, 2019, ⟨10.1016/j.jsc.2019.10.018⟩ |
||
hal-00654094v1
Journal articles
On the Complexity of the Generalized MinRank Problem Journal of Symbolic Computation, Elsevier, 2013, 55, pp.30-58. ⟨10.1016/j.jsc.2013.03.004⟩ ![]() |
||
hal-01312750v1
Conference papers
Critical Point Computations on Smooth Varieties: Degree and Complexity bounds International Symposium on Symbolic and Algebraic Computation (ISSAC), Jul 2016, Waterloo, Canada. pp.183--190, ⟨10.1145/2930889.2930929⟩ |
||
hal-00849057v3
Journal articles
A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets Journal of the ACM (JACM), Association for Computing Machinery, 2017, 63 (6), pp.48:1--48:37. ⟨10.1145/2996450⟩ |
||
hal-01237920v1
Conference papers
Optimizing a Parametric Linear Function over a Non-compact Real Algebraic Variety The 2015 ACM on International Symposium on Symbolic and Algebraic Computation, Jul 2015, Bath, United Kingdom. pp.205-212, ⟨10.1145/2755996.2756666⟩ |
||
|