◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

P. Spaenlehauer

19 papers hereh-index 14696 citations35 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • middle author4
  • last author14

Across the 19 of 19 papers where every author was matched, so the position is known.

fields
  • cs.SC11
  • math.NT3
  • cs.CR1
  • math.AG1
  • math.CO1
  • math.NA1

identity via Semantic Scholar / OpenAlex

activity
20102025
most citedOn the Complexity of Solving Quadratic Boolean Systems

93 citations · 154 across the 14 of their papers we have counts for

collaborators
Showing 2013 · cs.SCShow all

1 paper · 2 filters

cs.SC2013

On the Complexity of Computing Critical Points with Gröbner Bases

Pierre-Jean Spaenlehauer

Computing the critical points of a polynomial function q∈Q[X1​,…,Xn​] restricted to the vanishing locus V⊂Rn of polynomials $f_1,\ldots, f_p\in\ma…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.