A fast computer algorithm for finding the permanent of adjacency matrices (Q1360652)
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: A fast computer algorithm for finding the permanent of adjacency matrices |
scientific article; zbMATH DE number 1036966
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast computer algorithm for finding the permanent of adjacency matrices |
scientific article; zbMATH DE number 1036966 |
Statements
A fast computer algorithm for finding the permanent of adjacency matrices (English)
0 references
5 November 1997
0 references
fast computer algorithm
0 references
permanents
0 references
sparse matrices
0 references
chemical adjacency matrices
0 references
Kekulé structure
0 references
0.8174646496772766
0 references
0.7902900576591492
0 references
0.7826012372970581
0 references
