Understanding the average-case complexity of NP is a central goal in complexity theory and cryptography.
The thread discusses a research paper exploring the gap between average-case and worst-case complexity in computational complexity theory and cryptography. It highlights the importance of understanding this gap for the polynomial hierarchy …