• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates.

Anna GálKristoffer Arnsfelt HansenMichal KouckýPavel PudlákEmanuele Viola
Published in: STOC (2012)
Keyphrases
  • tight bounds
  • error correcting codes
  • upper bound
  • logic circuits
  • minimum distance
  • error correction
  • error correcting
  • depth map
  • lower bound
  • markov random field
  • feature space
  • high speed