We prove strengthened lower bounds for constant-depth set-multilinear
fo...
A recent series of papers by Andoni, Naor, Nikolov, Razenshteyn, and
Wai...
For a fixed "pattern" graph G, the colored G-subgraph
isomorphism proble...
We show that there is a randomized algorithm that, when given a small
co...
share