Almost Uniform Sampling of Independent Sets in Polynomial Time -- Implying NP=RP
Computational Complexity
2023-12-20 v1
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.
Keywords
Cite
@article{arxiv.2312.11838,
title = {Almost Uniform Sampling of Independent Sets in Polynomial Time -- Implying NP=RP},
author = {Andras Farago},
journal= {arXiv preprint arXiv:2312.11838},
year = {2023}
}
Comments
arXiv admin note: substantial text overlap with arXiv:2008.00601