On the linear classification of even and odd permutation matrices and the complexity of computing the permanent (Q2359079)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the linear classification of even and odd permutation matrices and the complexity of computing the permanent |
scientific article; zbMATH DE number 6736011
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the linear classification of even and odd permutation matrices and the complexity of computing the permanent |
scientific article; zbMATH DE number 6736011 |
Statements
On the linear classification of even and odd permutation matrices and the complexity of computing the permanent (English)
0 references
27 June 2017
0 references
permutation matrix
0 references
Kasteleyn algorithm
0 references
0.7872541546821594
0 references
0.7567963600158691
0 references
