Retour à l'index du GREYC

Séminaire Algorithmique

Site du CNRS

Séminaire Algorithmique

Le séminaire a lieu le mardi à 11 h 45 (sauf modification exceptionnelle), au campus Côte de Nacre, bâtiment Sciences 3, salle S3 351, 3ème étage.

Résumé du séminaire du Mardi 6 Mars 2018

Algorithmic problems in algebra: complexity and applications

par Delaram Kahrobaei (New York University, CUNY Graduate Center, City University of New York, Center for Logic, Algebra, Computation, USA)

In this talk, I consider several classical and novel algorithmic problems in combinational group theory, ` discussing the complexity. I study these problems with a view towards applications to post-quantum cryptography. I will present some recent results on some algorithmic problems for partially commutative groups. Some of which are closely related to graph theoretic problems, and I study their computational complexity. (joint work with Flores, Koberda) At the end, I will report on a recent result regarding a fast quantum algorithm or solving multivariate quadratic equations over finite fields. (joint work with Faugere, Horan, Kashefi, Kaplan)

Campus Côte de Nacre, boulevard du Maréchal Juin
BP 5186
14032 Caen Cedex
FAX : +33 (0)2 31 56 73 30