Generic case complexity of the graph isomorphism problem (Q285911)
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 6582786
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generic case complexity of the graph isomorphism problem |
scientific article; zbMATH DE number 6582786 |
Statements
Generic case complexity of the graph isomorphism problem (English)
0 references
19 May 2016
0 references
graph isomorphism
0 references
binomial random graph
0 references
Poisson distribution
0 references
Legendre polynomial
0 references
generic algorithm
0 references
0.7880449891090393
0 references
0.740080714225769
0 references
0.7394400835037231
0 references
0.732602059841156
0 references
0.730323851108551
0 references
