Towards Lower Bounds on Locally Testable Codes via Density Arguments.
Eli Ben-SassonMichael VidermanPublished in: Computational Complexity Conference (2011)
Keyphrases
- lower bound
- upper bound
- np hard
- branch and bound
- branch and bound algorithm
- error correction
- objective function
- lower and upper bounds
- optimal solution
- quadratic assignment problem
- upper and lower bounds
- low density
- sample complexity
- vc dimension
- linear programming relaxation
- special case
- lower bounding
- globally consistent
- optimal cost
- clustering algorithm