Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds.
Pavel HubácekEylon YogevPublished in: SIAM J. Comput. (2020)
Keyphrases
- query complexity
- concept class
- lower bound
- learning theory
- vc dimension
- concept classes
- np hard
- upper bound
- membership queries
- optimal solution
- worst case
- data complexity
- dnf formulas
- search algorithm
- objective function
- lower and upper bounds
- exact learning
- genetic algorithm
- pac learning
- simulated annealing
- upper and lower bounds
- sample complexity
- uniform distribution
- target concept
- np complete
- computational complexity
- learning algorithm
- concept learning
- efficient learning
- equivalence queries
- databases