https://hackerpaper.kaipfister.de/p/cs_0606037/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=34950639urn:hackerpapers:mention:cs_0606037:34950639Sun, 26 Feb 2023 23:03:02 GMT<p>Average-case complexity is studied quite a bit. There is some discussion on wikipedia [1]. Also see this paper, which discusses the average-case complexity of NP problems [2] The reason why its not studied as much by theoretical computer science as is by algorithm-implementers, is that &quot;average&quot; is not uniquely defined. For instance, you can talk about the uniform distribution for a lot of problems, but not always. Suppose you want to investigate the complexity of solving certain types of equations, involving matrices as unknowns. How do you take the uniform distribution over matrices over…</p><p><a href="https://hackerpaper.kaipfister.de/p/cs_0606037/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.CChttps://news.ycombinator.com/item?id=29715877urn:hackerpapers:mention:cs_0606037:29715877Tue, 28 Dec 2021 17:32:21 GMT<p>This is useful information, thank you for sharing this theorem! I am still skeptical about the soundness of the verifier&#x27;s challenge generating mechanism. Assuming P!=NP and the challenge is drawn uniformly from the full space, I am still not convinced that the prover does not have access to a backdoor which makes the challenge &quot;easier&quot; on average than the challenger realizes. Even if challenge instances are superpolynomial in the worst case, empirically, we know from SAT solving competitions that a very small fraction of randomly sampled k-SAT instances are truly hard and most are in P. It…</p><p><a href="https://hackerpaper.kaipfister.de/p/cs_0606037/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.CC