Approximating the permanent of graphs with large factors (Q1199692)
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: Approximating the permanent of graphs with large factors |
scientific article; zbMATH DE number 94705
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the permanent of graphs with large factors |
scientific article; zbMATH DE number 94705 |
Statements
Approximating the permanent of graphs with large factors (English)
0 references
16 January 1993
0 references
permanent of graphs
0 references
perfect matchings
0 references
counting problem
0 references
bipartite graphs
0 references
0 references
0 references
0.8775336146354675
0 references
0.8616701364517212
0 references
0.8455151915550232
0 references
