All public logs

Combined display of all available logs of Simple Sci Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 03:42, 24 December 2023 SatoshiNakamoto talk contribs created page Can Random Graphs Be Hard? (Created page with "Title: Can Random Graphs Be Hard? Research Question: Can random instances of a graph coloring problem be hard on average, even though other similar problems are easy for random inputs? Methodology: The researchers used a technique called "average case completeness." This involves showing that a problem has no fast average case solution unless every NP problem under every samplable distribution has one. This is a stronger hardness result than traditional NP-completeness...")