A recent trend in Computer Algebra? Let's chat!

Collection 2023 - T3 - WS1 - Fundamental algorithms and algorithmic complexity

Organizer(s) van der Hoeven, Joris ; Giesbrecht, Mark ; Koiran, Pascal ; Villard, Gilles

Date(s) 25/09/2023 - 29/09/2023

linked URL https://indico.math.cnrs.fr/event/8113/

A recent trend in Computer Algebra? Let's chat!

published on September 25, 2023

By Joachim von zur Gathen

Recent progress on deterministic integer factorisation

published on September 25, 2023

Recent progress on deterministic integer factorisation

By David Harvey

published on September 25, 2023

Efficient approximation of polynomials

By Guillaume Moroz

First-order factors of linear Mahler operators

published on September 25, 2023

First-order factors of linear Mahler operators

By Frédéric Chyzak

Coppersmith’s algorithm and polynomial equations

published on September 25, 2023

Coppersmith’s algorithm and polynomial equations

By Éric Schost

published on September 26, 2023

Matrix multiplication via Lie groups

By Chris Umans

Superpolynomial lower bounds against low-depth algebraic circuits

published on September 26, 2023

Superpolynomial lower bounds against low-depth algebraic circuits

By Sébastien Tavenas

Border rank, homogeneity and de-bordering paradigms in GCT

published on September 26, 2023

Border rank, homogeneity and de-bordering paradigms in GCT

By Pranjal Dutta

Efficient algorithms for Riemann-Roch spaces

published on September 26, 2023

Efficient algorithms for Riemann-Roch spaces

By Grégoire Lecerf

Computing the non-commutative rank of linear matrices

published on September 27, 2023

Computing the non-commutative rank of linear matrices

By Gábor Ivanyos

Closure of algebraic complexity classes under factoring

published on September 27, 2023

Closure of algebraic complexity classes under factoring

By Nitin Saxena

published on September 28, 2023

Interpolating isogenies

By Benjamin Wesolowski

On the complexity of computing characteristic polynomials

published on September 28, 2023

On the complexity of computing characteristic polynomials

By Clément Pernet

The practical complexity of arbitrary-precision functions

published on September 28, 2023

The practical complexity of arbitrary-precision functions

By Fredrik Johansson

Computing Sparse Fourier Sum of Squares on Finite Abelian Groups

published on September 28, 2023

Computing Sparse Fourier Sum of Squares on Finite Abelian Groups

By Lihong Zhi

Sparse interpolation and Exponential analysis going hand in hand

published on September 29, 2023

Sparse interpolation and Exponential analysis going hand in hand

By Annie Cuyt

Modulus tricks for integer sparse polynomials

published on September 29, 2023

Modulus tricks for integer sparse polynomials

By Daniel Roche

Mathematics
and Interactions

Frontiers in Sub-Riemannian Geometry / Aux frontières de la géométrie sous-riemannienne

Algebraic geometry and complex geometry / Géométrie algébrique et géométrie complexe

Not Only Scalar Curvature Seminar

12e Séminaire Itzykson : problèmes spectraux quantiques en physique mathématique

Collection 2023 - T3 - WS1 - Fundamental algorithms and algorithmic complexity