13 citations · 17 across the 5 of their papers we have counts for
3 papers · 1 filter
Monochromatic Triangles, Intermediate Matrix Products, and Convolutions
Andrea Lincoln, Adam Polak, Virginia Vassilevska Williams
The most studied linear algebraic operation, matrix multiplication, has surprisingly fast time algorithms for . On the other hand, the matrix product w…
New Techniques for Proving Fine-Grained Average-Case Hardness
Mina Dalirrooyfard, Andrea Lincoln, Virginia Vassilevska Williams
The recent emergence of fine-grained cryptography strongly motivates developing an average-case analogue of Fine-Grained Complexity (FGC). This paper defines new versions of OV, $k…
Faster Random -CNF Satisfiability
Andrea Lincoln, Adam Yedidia
We describe an algorithm to solve the problem of Boolean CNF-Satisfiability when the input formula is chosen randomly. We build upon the algorithms of Sch{ö}ning 1999 and Dantsin e…