Nombre de documents

11

CV de Pierre-Jean Spaenlehauer


Thèse1 document

  • Pierre-Jean Spaenlehauer. Solving multi-homogeneous and determinantal systems: algorithms, complexity, applications.. Symbolic Computation [cs.SC]. Université Pierre et Marie Curie (Univ. Paris 6), 2012. English. <tel-01110756>

Article dans une revue4 documents

  • Éric Schost, Pierre-Jean Spaenlehauer. A Quadratically Convergent Algorithm for Structured Low-Rank Approximation. Foundations of Computational Mathematics, Springer Verlag, 2015, pp.1-36. <hal-00953684>
  • Pierre-Jean Spaenlehauer. On the Complexity of Computing Critical Points with Gröbner Bases. SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2014, 24 (3), pp.1382-1401. <hal-01017032>
  • Giorgio Ottaviani, Pierre-Jean Spaenlehauer, Bernd Sturmfels. Exact Solutions in Structured Low-Rank Approximation. SIAM Journal on Matrix Analysis and Applications, Society for Industrial and Applied Mathematics, 2014, 35, 4, pp.1521-1542. <hal-00953702>
  • Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer. 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-00654094>

Communication dans un congrès5 documents

  • Mohab Safey El Din, Pierre-Jean Spaenlehauer. Critical Point Computations on Smooth Varieties: Degree and Complexity bounds. International Symposium on Symbolic and Algebraic Computation (ISSAC), Jul 2016, Waterloo, Canada. Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, pp.183--190, 2016, <10.1145/2930889.2930929>. <hal-01312750>
  • Jean-Charles Faugère, Pierre-Jean Spaenlehauer, Jules Svartz. Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems. International Symposium on Symbolic and Algebraic Computation (ISSAC 2016), Jul 2016, Waterloo, Canada. ACM, Proceedings of ISSAC 2016, pp.223-230, <10.1145/2930889.2930927>. <hal-01314651>
  • Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer. Critical Points and Gröbner Bases: the Unmixed Case. ISSAC 2012 - International Symposium on Symbolic and Algebraic Computation - 2012, Jul 2012, Grenoble, France. ACM, pp.162-169, 2012, <10.1145/2442829.2442855>. <hal-00667494>
  • Jean-Charles Faugère, Pierre-Jean Spaenlehauer. Algebraic Cryptanalysis of the PKC'09 Algebraic Surface Cryptosystem. Phong Q Nguyen; David Pointcheval. PKC 2010 - 13th International Conference on Practice and Theory in Public Key Cryptography, May 2010, Paris, France. Springer, 6056, pp.35-52, 2010, Lecture Notes in Computer Science. <10.1007/978-3-642-13013-7_3>. <hal-01057831>
  • Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer. Computing Loci of Rank Defects of Linear Matrices using Gröbner Bases and Applications to Cryptology. ISSAC 2010 - 35th International Symposium on Symbolic and Algebraic Computation, Jul 2010, Munich, Germany. ACM, pp.257-264, 2010, <10.1145/1837934.1837984>. <hal-01057840>

Pré-publication, Document de travail1 document

  • Frédéric Bihan, Pierre-Jean Spaenlehauer. Sparse Polynomial Systems with many Positive Solutions from Bipartite Simplicial Complexes. 2016. <hal-01217547v2>