On the Lower Bound on the Length of Relaxed Locally Decodable Codes.
Oded GoldreichPublished in: Electron. Colloquium Comput. Complex. (2023)
Keyphrases
- lower bound
- optimal solution
- upper bound
- locally decodable codes
- branch and bound algorithm
- branch and bound
- objective function
- np hard
- lower and upper bounds
- worst case
- lower bounding
- cryptographic protocols
- information systems
- private information retrieval schemes
- sufficiently accurate
- wireless sensor networks
- search algorithm
- conflict resolution
- linear programming relaxation
- polynomial approximation