Can Random Graphs Be Hard?: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 03:4203:42, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,444 bytes +1,444‎ 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..."
Retrieved from "https://simplesci.org/wiki/Can_Random_Graphs_Be_Hard%3F"