On the number of \(k\)-cycles in the assignment problem for random matrices (Q5239474)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7120672
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of \(k\)-cycles in the assignment problem for random matrices |
scientific article; zbMATH DE number 7120672 |
Statements
On the number of<i>k</i>-cycles in the assignment problem for random matrices (English)
0 references
22 October 2019
0 references
random graphs
0 references
networks
0 references
typical-case computational complexity
0 references
0 references
0.7660784125328064
0 references
0.7560633420944214
0 references
0.7560181617736816
0 references
0.7514821887016296
0 references
