◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

J. Faugère

31 papers hereh-index 429.5k citations219 works total

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

author position
  • first author13
  • middle author12
  • last author6

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

fields
  • cs.SC23
  • cs.CR2
  • cs.IT2
  • math.AC2
  • math.AG1
  • quant-ph1

identity via Semantic Scholar / OpenAlex

activity
20072025
most citedOn the Complexity of Solving Quadratic Boolean Systems

93 citations · 387 across the 28 of their papers we have counts for

collaborators
Showing 2011Show all

2 papers · 1 filter

cs.SC2011★ 93 cited

On the Complexity of Solving Quadratic Boolean Systems

Magali Bardet, Jean-Charles Faugère, Bruno Salvy +1

A fundamental problem in computer science is to find all the common zeroes of m quadratic polynomials in n unknowns over F2​. The cryptanalysis of several modern cip…

cs.SC2011★ 3 cited

On the Complexity of the Generalized MinRank Problem

Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer

We study the complexity of solving the \emph{generalized MinRank problem}, i.e. computing the set of points where the evaluation of a polynomial matrix has rank at most r. A natu…

◍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.