Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds.
Pavel HubácekEylon YogevPublished in: SODA (2017)
Keyphrases
- query complexity
- lower bound
- concept class
- learning theory
- vc dimension
- concept classes
- upper bound
- np hard
- membership queries
- worst case
- optimal solution
- equivalence queries
- data complexity
- exact learning
- genetic algorithm
- search algorithm
- np complete
- dnf formulas
- objective function
- phase transition
- pac learning
- sample complexity
- uniform distribution
- concept learning
- sample size
- simulated annealing
- databases
- database
- statistical queries
- computational complexity
- inductive inference
- lower and upper bounds
- upper and lower bounds
- data management
- data warehouse
- scheduling problem
- training data