Towards lower bounds on locally testable codes via density arguments.
Eli Ben-SassonMichael VidermanPublished in: Electron. Colloquium Comput. Complex. (2010)
Keyphrases
- lower bound
- upper bound
- lower and upper bounds
- np hard
- branch and bound algorithm
- objective function
- lower bounding
- branch and bound
- low density
- optimal solution
- argumentation systems
- density function
- upper and lower bounds
- error correction
- vc dimension
- quadratic assignment problem
- worst case
- special case
- random graphs
- error control
- data sets