activity
20152025
most citedRoots of Sparse Polynomials over a Finite Field

10 citations · 13 across the 7 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2023

New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms

Amir Abboud, Nick Fischer, Zander Kelley +2

We revisit the fundamental Boolean Matrix Multiplication (BMM) problem. With the invention of algebraic fast matrix multiplication over 50 years ago, it also became known that BMM…