Подразделения : | ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
Бывшая команда : | ACASA |
Публикации PolSys | 2023 | 2024 | Total |
---|---|---|---|
Книги | 0 | 0 | 0 |
Издания книг | 0 | 0 | 0 |
Статьи в журналах | 8 | 3 | 11 |
Статьи | 0 | 0 | 0 |
Статьи конференций | 7 | 1 | 8 |
Хабилитации | 1 | 0 | 1 |
Диссертация | 2 | 0 | 2 |
- M. Albrecht, C. Cid, J.‑Ch. Faugère, R. Fitzpatrick, L. Perret : “On the complexity of the BKW algorithm on LWE”, Designs, Codes and Cryptography, vol. 74 (2), pp. 26, (Springer Verlag) [Albrecht 2015]
- M. Bardet, J.‑Ch. Faugère, B. Salvy : “On the complexity of the F5 Gröbner basis algorithm”, Journal of Symbolic Computation, vol. 70, pp. 49-70, (Elsevier) [Bardet 2015]
- J. Berthomieu, J.‑Ch. Faugère, L. Perret : “Polynomial-Time Algorithms for Quadratic Isomorphism of Polynomials: The Regular Case”, Journal of Complexity, vol. 31 (4), pp. 590-616, (Elsevier) [Berthomieu 2015b]
- Victor Y. Pan, E. Tsigaridas : “Nearly Optimal Refinement of Real Roots of a Univariate Polynomial”, Journal of Symbolic Computation, vol. 74, pp. 181–204, (Elsevier) [Pan 2015a]