Theoremresearch
Jerrum–Valiant–Vazirani theorem
Also called Jerrum-Valiant-Vazirani theorem, counting and sampling are interreducible, counting-sampling equivalence.
For self-reducible problems, approximate counting and approximate uniform sampling are polynomially equivalent.
For self-reducible problems, approximate counting and approximate uniform sampling are polynomially equivalent.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag Z95ZM0 Edit this page History Report an error