activity
20032013
most citedSharp kernel clustering algorithms and their associated Grothendieck inequalities

2 citations · 2 across the 5 of their papers we have counts for

collaborators
Showing 2010Show all

1 paper · 1 filter

cs.CC2010

A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem

Per Austrin, Subhash Khot

We present a simple deterministic gap-preserving reduction from SAT to the Minimum Distance of Code Problem over $\F_2$. We also show how to extend the reduction to work over any f…