Pierre-Jean Spaenlehauer
Orcid: 0000-0001-7906-0505
According to our database1,
Pierre-Jean Spaenlehauer
authored at least 26 papers
between 2010 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
Dimension results for extremal-generic polynomial systems over complete toric varieties.
CoRR, 2023
2022
Hard Homogeneous Spaces from the Class Field Theory of Imaginary Hyperelliptic Function Fields.
IACR Cryptol. ePrint Arch., 2022
2020
Math. Comput., 2020
IACR Cryptol. ePrint Arch., 2020
2019
Found. Comput. Math., 2019
2018
SIAM J. Appl. Algebra Geom., 2018
CoRR, 2018
2016
Found. Comput. Math., 2016
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016
2015
Sparse Polynomial Systems with many Positive Solutions from Bipartite Simplicial Complexes.
CoRR, 2015
2014
SIAM J. Matrix Anal. Appl., 2014
SIAM J. Optim., 2014
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014
2013
Complexity Bounds for Computing Critical Points with Gröbner Bases Algorithms: the Mixed Case.
CoRR, 2013
Newton-like iteration for determinantal systems and structured low rank approximation.
ACM Commun. Comput. Algebra, 2013
2012
Solving multi-homogeneous and determinantal systems: algorithms, complexity, applications. (Résolution de systèmes multi-homogènes et déterminantiels : algorithmes, complexité, applications).
PhD thesis, 2012
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012
2011
Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1, 1): Algorithms and complexity.
J. Symb. Comput., 2011
2010
Gröbner Bases of Bihomogeneous Ideals generated by Polynomials of Bidegree (1,1): Algorithms and Complexity
CoRR, 2010
Proceedings of the Public Key Cryptography, 2010
Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010