Hardness of continuous local search: Query complexity and cryptographic lower bounds

Keyphrases

• Cryptography 100%
• Search Queries 100%
• Black Box 100%
• Query Complexity 100%
• Local Search 100%
• Continuous Local Search 100%
• White-box 100%
• Hardness Results 66%
• Search Problems 66%
• Local Optimum 66%
• Optimization Problem 33%
• Oracle 33%
• Computational Complexity 33%
• Randomized Algorithms 33%
• Genetic Algorithm 33%
• Complexity Classes 33%
• Cryptographic Assumptions 33%
• Continuous Domain 33%
• Continuous Function 33%
• Simplex Algorithm 33%
• Hard Optimization Problems 33%
• NP Search Problems 33%
• Conceptual Barriers 33%
• Total Search Problems 33%
• Simulated Annealing Algorithm 33%
• Guaranteed Solution 33%

Computer Science

• Optimization Problem 100%
• Subclasses 100%
• Local Search Query 100%
• Efficient Algorithm 50%
• Computational Complexity 50%
• Randomized Algorithm 50%
• Complexity Class 50%
• Genetic Algorithm 50%
• Simulated Annealing 50%
• Continuous Domain 50%
• Continuous Function 50%
• Simplex Algorithm 50%

Mathematics

• Query Complexity 100%
• Local Search 100%
• Black Box 60%
• Local Optimum 40%
• Continuous Function 20%
• Simplex Algorithm 20%
• Genetic Algorithm 20%
• Continuous Domain 20%
• Simulated Annealing Algorithm 20%