default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPierre-Jean Spaenlehauer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Antoine Leudière, Pierre-Jean Spaenlehauer
:
Computing a group action from the class field theory of imaginary hyperelliptic function fields. J. Symb. Comput. 125: 102311 (2024)- 2023
- [i19]Matías R. Bender, Pierre-Jean Spaenlehauer:
Dimension results for extremal-generic polynomial systems over complete toric varieties. CoRR abs/2305.07439 (2023) - 2022
- [i18]Antoine Leudière, Pierre-Jean Spaenlehauer:
Hard Homogeneous Spaces from the Class Field Theory of Imaginary Hyperelliptic Function Fields. CoRR abs/2203.06970 (2022) - [i17]Antoine Leudière, Pierre-Jean Spaenlehauer:
Hard Homogeneous Spaces from the Class Field Theory of Imaginary Hyperelliptic Function Fields. IACR Cryptol. ePrint Arch. 2022: 349 (2022) - 2020
- [j11]Aude Le Gluher, Pierre-Jean Spaenlehauer:
A fast randomized geometric algorithm for computing Riemann-Roch spaces. Math. Comput. 89(325): 2399-2433 (2020) - [i16]Aude Le Gluher, Pierre-Jean Spaenlehauer, Emmanuel Thomé:
Refined Analysis of the Asymptotic Complexity of the Number Field Sieve. CoRR abs/2007.02730 (2020) - [i15]Aude Le Gluher, Pierre-Jean Spaenlehauer, Emmanuel Thomé:
Refined Analysis of the Asymptotic Complexity of the Number Field Sieve. IACR Cryptol. ePrint Arch. 2020: 829 (2020)
2010 – 2019
- 2019
- [j10]Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer:
Improved Complexity Bounds for Counting Points on Hyperelliptic Curves. Found. Comput. Math. 19(3): 591-621 (2019) - 2018
- [j9]Frédéric Bihan, Francisco Santos, Pierre-Jean Spaenlehauer:
A Polyhedral Method for Sparse Systems with Many Positive Solutions. SIAM J. Appl. Algebra Geom. 2(4): 620-645 (2018) - [i14]Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer:
Counting points on genus-3 hyperelliptic curves with explicit real multiplication. CoRR abs/1806.05834 (2018) - [i13]Aude Le Gluher, Pierre-Jean Spaenlehauer:
A Fast Randomized Geometric Algorithm for Computing Riemann-Roch Spaces. CoRR abs/1811.08237 (2018) - 2017
- [i12]Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer:
Improved Complexity Bounds for Counting Points on Hyperelliptic Curves. CoRR abs/1710.03448 (2017) - 2016
- [j8]Éric Schost, Pierre-Jean Spaenlehauer:
A Quadratically Convergent Algorithm for Structured Low-Rank Approximation. Found. Comput. Math. 16(2): 457-492 (2016) - [c6]Mohab Safey El Din, Pierre-Jean Spaenlehauer:
Critical Point Computations on Smooth Varieties: Degree and Complexity Bounds. ISSAC 2016: 183-190 - [c5]Jean-Charles Faugère, Pierre-Jean Spaenlehauer, Jules Svartz:
Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems. ISSAC 2016: 223-230 - [i11]Mohab Safey El Din, Pierre-Jean Spaenlehauer:
Critical Point Computations on Smooth Varieties: Degree and Complexity bounds. CoRR abs/1605.02518 (2016) - [i10]Jean-Charles Faugère, Pierre-Jean Spaenlehauer, Jules Svartz:
Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems. CoRR abs/1605.05889 (2016) - 2015
- [j7]Jean-Charles Faugère, Pierre-Jean Spaenlehauer, Jules Svartz:
Sparse Gröbner bases: algorithms and complexity. ACM Commun. Comput. Algebra 49(2): 61-62 (2015) - [i9]Frédéric Bihan, Pierre-Jean Spaenlehauer:
Sparse Polynomial Systems with many Positive Solutions from Bipartite Simplicial Complexes. CoRR abs/1510.05622 (2015) - 2014
- [j6]Pierre-Jean Spaenlehauer:
On the Complexity of Computing Critical Points with Gröbner Bases. SIAM J. Optim. 24(3): 1382-1401 (2014) - [j5]Giorgio Ottaviani, Pierre-Jean Spaenlehauer, Bernd Sturmfels:
Exact Solutions in Structured Low-Rank Approximation. SIAM J. Matrix Anal. Appl. 35(4): 1521-1542 (2014) - [c4]Jean-Charles Faugère, Pierre-Jean Spaenlehauer, Jules Svartz:
Sparse Gröbner bases: the unmixed case. ISSAC 2014: 178-185 - [i8]Jean-Charles Faugère, Pierre-Jean Spaenlehauer, Jules Svartz:
Sparse Gröbner Bases: the Unmixed Case. CoRR abs/1402.7205 (2014) - 2013
- [j4]Éric Schost, Pierre-Jean Spaenlehauer:
Newton-like iteration for determinantal systems and structured low rank approximation. ACM Commun. Comput. Algebra 47(3/4): 96-97 (2013) - [j3]Magali Bardet, Jean-Charles Faugère, Bruno Salvy, Pierre-Jean Spaenlehauer:
On the complexity of solving quadratic Boolean systems. J. Complex. 29(1): 53-75 (2013) - [j2]Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer:
On the complexity of the generalized MinRank problem. J. Symb. Comput. 55: 30-58 (2013) - [i7]Pierre-Jean Spaenlehauer:
Complexity Bounds for Computing Critical Points with Gröbner Bases Algorithms: the Mixed Case. CoRR abs/1309.2138 (2013) - [i6]Giorgio Ottaviani, Pierre-Jean Spaenlehauer, Bernd Sturmfels:
Algebraic Methods for Structured Low-Rank Approximation. CoRR abs/1311.2376 (2013) - [i5]Éric Schost, Pierre-Jean Spaenlehauer:
A Quadratically Convergent Algorithm for Structured Low-Rank Approximation. CoRR abs/1312.7279 (2013) - 2012
- [b1]Pierre-Jean Spaenlehauer:
Solving multi-homogeneous and determinantal systems: algorithms, complexity, applications. (Résolution de systèmes multi-homogènes et déterminantiels : algorithmes, complexité, applications). Pierre and Marie Curie University, Paris, France, 2012 - [c3]Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer:
Critical points and Gröbner bases: the unmixed case. ISSAC 2012: 162-169 - [i4]Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer:
Critical Points and Gröbner Bases: the Unmixed Case. CoRR abs/1202.0179 (2012) - 2011
- [j1]Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean 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) - [i3]Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer:
On the Complexity of the Generalized MinRank Problem. CoRR abs/1112.4411 (2011) - [i2]Magali Bardet, Jean-Charles Faugère, Bruno Salvy, Pierre-Jean Spaenlehauer:
On the Complexity of Solving Quadratic Boolean Systems. CoRR abs/1112.6263 (2011) - 2010
- [c2]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: 257-264 - [c1]Jean-Charles Faugère, Pierre-Jean Spaenlehauer:
Algebraic Cryptanalysis of the PKC'2009 Algebraic Surface Cryptosystem. Public Key Cryptography 2010: 35-52 - [i1]Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer:
Gröbner Bases of Bihomogeneous Ideals generated by Polynomials of Bidegree (1,1): Algorithms and Complexity. CoRR abs/1001.4004 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
