Towards lower bounds on locally testable codes via density arguments.
Eli Ben-SassonMichael VidermanPublished in: Comput. Complex. (2012)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- objective function
- lower and upper bounds
- low density
- worst case
- np hard
- upper and lower bounds
- error correction
- vc dimension
- error control
- globally consistent
- set of randomly generated instances
- randomly generated problems
- lower bounding
- quadratic assignment problem
- online algorithms
- neural network
- optimal cost
- computational complexity
- special case
- logical operations
- polynomial approximation
- legal argument
- probability distribution