853 citations
- Sorbonne UniversitéFR398 papers
- Centre National de la Recherche ScientifiqueFR380 papers
- Université Paris CitéFR136 papers
- Université Pierre-et-Marie-CurieFR97 papers
- University of EdinburghGB89 papers
- Institut national de recherche en sciences et technologies du numériqueFR85 papers
- Université Paris-SaclayFR67 papers
- University of OxfordGB54 papers
- École PolytechniqueFR50 papers
- Sorbonne Paris CitéFR48 papers
- Massachusetts Institute of TechnologyUS45 papers
- Universidade Federal do Rio de JaneiroBR45 papers
Showing 2011 · cs.SCShow all
2 papers · 2 filters
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 quadratic polynomials in unknowns over . The cryptanalysis of several modern cip…
cs.SC2011
A New Algorithmic Scheme for Computing Characteristic Sets
Meng Jin, Xiaoliang Li, Dongming Wang
Ritt-Wu's algorithm of characteristic sets is the most representative for triangularizing sets of multivariate polynomials. Pseudo-division is the main operation used in this algor…