activity
20132026
most citedOn the computational complexity of the probabilistic label tree algorithms

3 citations · 15 across the 20 of their papers we have counts for

collaborators
Showing 2017Show all

2 papers · 1 filter

cs.CC2017

String Matching: Communication, Circuits, and Learning

Alexander Golovnev, Mika Göös, Daniel Reichman +1

String matching is the problem of deciding whether a given -bit string contains a given -bit pattern. We study the complexity of this problem in three settings. Communication…

cs.CC2017

On the Quantitative Hardness of CVP

Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz

$ \newcommand{\eps}{\varepsilon} \newcommand{\problem}[1]{\ensuremath{\mathrm{#1}} } \newcommand{\CVP}{\problem{CVP}} \newcommand{\SVP}{\problem{SVP}} \newcommand{\CVPP}{\problem{C…