Sharp-P-Completeness of 01-Permanent

The sharp-P-completeness of 01-permanent, sometimes known as Valiant's theorem, is a result in computational complexity theory. In 1979 Leslie Valiant proved that computing the permanent of a matrix is sharp-P-hard, even when the matrix is restricted to have entries that are all 0 or 1. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/