Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
0-1 matrices
Boolean matrices permanent function |
| gptkbp:author |
gptkb:Leslie_Valiant
|
| gptkbp:field |
theoretical computer science
|
| https://www.w3.org/2000/01/rdf-schema#label |
Valiant's theorem
|
| gptkbp:impact |
established the hardness of computing the permanent
|
| gptkbp:implies |
computing the permanent is at least as hard as any problem in #P
|
| gptkbp:namedAfter |
gptkb:Leslie_Valiant
|
| gptkbp:publishedIn |
Theoretical Computer Science
|
| gptkbp:relatedTo |
gptkb:P_versus_NP_problem
#P-completeness |
| gptkbp:state |
the permanent of a matrix is #P-complete
|
| gptkbp:usedIn |
gptkb:complexity_theory
algebraic complexity theory |
| gptkbp:yearProposed |
1979
|
| gptkbp:bfsParent |
gptkb:Leslie_Valiant
|
| gptkbp:bfsLayer |
5
|