The following pages link to Pierre-Jean Spaenlehauer (Q285439):
Displaying 19 items.
- A quadratically convergent algorithm for structured low-rank approximation (Q285440) (← links)
- On the complexity of the generalized MinRank problem (Q390388) (← links)
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity (Q629349) (← links)
- On the complexity of solving quadratic Boolean systems (Q1931429) (← links)
- Improved complexity bounds for counting points on hyperelliptic curves (Q2420634) (← links)
- On the Complexity of Computing Critical Points with Gröbner Bases (Q2934482) (← links)
- Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology (Q2946547) (← links)
- Critical Point Computations on Smooth Varieties (Q2985826) (← links)
- Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems (Q2985831) (← links)
- Sparse Gröbner bases (Q3452392) (← links)
- Algebraic Cryptanalysis of the PKC’2009 Algebraic Surface Cryptosystem (Q3562886) (← links)
- A Polyhedral Method for Sparse Systems with Many Positive Solutions (Q4624926) (← links)
- A fast randomized geometric algorithm for computing Riemann-Roch spaces (Q5113675) (← links)
- Critical points and Gröbner bases (Q5244531) (← links)
- Exact Solutions in Structured Low-Rank Approximation (Q5246493) (← links)
- Counting points on genus-3 hyperelliptic curves with explicit real multiplication (Q6165852) (← links)
- Dimension results for extremal-generic polynomial systems over complete toric varieties (Q6196136) (← links)
- Computing a Group Action from the Class Field Theory of Imaginary Hyperelliptic Function Fields (Q6507758) (← links)
- Computing a group action from the class field theory of imaginary hyperelliptic function fields (Q6543075) (← links)
