Almost Uniform Sampling of Independent Sets in Polynomial Time -- Implying NP=RP
Abstract
We prove the unexpected result that almost uniform sampling of independent sets in graphs is possible via a probabilistic polynomial time algorithm. Note that our sampling algorithm (if correct) has extremely surprising consequences; the most important one being no less than the unlikely collapse NP=RP.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.