If NP languages are hard on the worst-case then it is easy to find their hard instances

Keyphrases

• Boolean Formulas 50%
• Cryptography 50%
• Fixed Distribution 50%
• Hard Example 100%
• NP-complete 100%
• Polynomial-time Algorithm 100%
• Probabilistic Algorithm 100%
• Quasi-polynomial Time 50%
• Samplable Distributions 100%
• Stochastic Polynomial 100%
• Worst-case Performance 50%

Computer Science

• Boolean Formula 50%
• Cryptography 50%
• Polynomial Time 50%
• Polynomial Time Algorithm 100%

Mathematics

• Cryptography 20%
• Polynomial Time 60%
• Probabilistic Algorithm 40%
• Worst Case 100%