On the complexity of symbolic computation
HomepagePublicationsTalksTeXmacsMathemagix

Résumé

How fast can we perform basic operations in symbolic computation and how does this impact the complexity for solving more elaborate problems? In our talk we will survey computer algebra from this complexity perspective, while considering both theoretical and practical aspects.

Occasion: ISSAC 2022, Villeneuve–d'Ascq, July 5

Documents: slideshow, TeXmacs source