On the generic complexity of the searching graph isomorphism problem (Q889990)
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 6506199
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the generic complexity of the searching graph isomorphism problem |
scientific article; zbMATH DE number 6506199 |
Statements
On the generic complexity of the searching graph isomorphism problem (English)
0 references
9 November 2015
0 references
generic-case complexity
0 references
graph isomorphism
0 references
searching graph isomorphism problem
0 references
0 references
0.91656876
0 references
0.9074463
0 references
0 references
0.9038032
0 references
0.8934357
0 references
0.89310503
0 references
