bibliographer a curated TCS bibliography
  • obsidian
  • tags
  • authors
  • no doi
  • no pdf
  • bad author
  • add item
  • librarian

Integer multiplication is at least as hard as matrix transposition David Harvey Joris van der Hoeven [github]
Polynomial Multiplication over Finite Fields in Time O(n log n ) David Harvey Joris van der Hoeven [github]
Integer multiplication in time O(nmathrmlog, n) David Harvey Joris van der Hoeven [github]
Integer multiplication in time O(n log n) David Harvey Joris Van Der Hoeven [github]
Faster Polynomial Multiplication over Finite Fields David Harvey Joris Van Der Hoeven Grégoire Lecerf [github]

Library Size: 13G (5 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A badge
[show logs] [hide logs]