Fundamental Algorithms and Algorithmic Complexity

Amphithéâtre Hermite / Darboux (Institut Henri Poincaré)

Amphithéâtre Hermite / Darboux

Institut Henri Poincaré

11 rue Pierre et Marie Curie 75005 Paris

Workshop with special week

Detailed informations on the dedicated website: Special week schedule and Workshop schedule

Special week

September 18 to 22, 2023

  • Efficient Algorithms for Integer and Polynomial Matrices. Long course by G. Labahn and A. Storjohann. Monday 18th, Tuesday 19th, Thursday 21rst, and Friday 22nd, 9:30-12:00, Amphitheater Darboux
  • Euclidean Lattices. Short course by D. Stehlé. Tuesday 19th, 14:00-16:00, Amphitheater Darboux, and Wednesday 20th,10:00-12:00, Amphitheater Hermite
  • General audience presentation by J. van der Hoeven. Wednesday 20th, 16:00-17:00, Amphitheater Hermite

Workshop: Fundamental Algorithms and Algorithmic Complexity

September 25 to 29, 2023

Organisers: J. van der Hoeven, M. Giesbrecht, P. Koiran, G. Villard

The field of computational complexity aims at understanding the capabilities of computational devices and especially how fast various problems can be solved. A lot of research focuses on isolating and studying complexity classes of those problems that can be solved using a certain amount of resources. One of the most interesting and challenging problem in the area of computer algebra, is to develop tools and methods in complexity theory that also reflects running times that are observed in practice, for a wide selection of data types. The computer algebra research community indeed produces software that proceed on various mathematical objects and having high impact. This requires expertise from many areas of computer science and of mathematics.

This workshop aims at bringing together experts from both the theoretical and more practical sides, while covering a wide spectrum of problems from algebra, geometry, symbolic computation, arithmetic, and numerical computation. Specific challenges that the workshop will focus on include the following: polynomials in complexity, structured problems, tensors, complexity and specification, certificates and their links with delegated computation, efficiency in crypto-algebro algorithms, HPC implementation of core algorithms, complexity in numerical analysis. 

Invited speakers

Courses and special week registration
Workshop registration