- Polynomial-time Tractable Problems over the p-adic Numbers Arno Fehm Manuel Bodirsky Fri 25 April 2025
- The Structural Complexity of Matrix-Vector Multiplication Emile Anand Jan van den Brand Rose McCarty Sun 09 March 2025
- Matrix-by-matrix multiplication algorithm with O(N^2log2N) computational complexity for variable precision arithmetic Maciej Paszyński Sat 02 November 2024
- Completeness classes in algebraic complexity theory Peter Burgisser Sun 23 June 2024
- Quasi-optimal multiplication of linear differential operators Alexandre Benoit Alin Bostan Joris van der Hoeven Thu 02 February 2023
- On the Skolem Problem for Continuous Linear Dynamical Systems Ventsislav Chonev Joel Ouaknine James Worrell Tue 30 April 2019
Library Size: 13G (6 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A
