Graph isomorphism in quasipolynomial time (extended abstract) (Q5361871)
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 6784111
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph isomorphism in quasipolynomial time (extended abstract) |
scientific article; zbMATH DE number 6784111 |
Statements
Graph isomorphism in quasipolynomial time [extended abstract] (English)
0 references
29 September 2017
0 references
algorithms
0 references
complexity of computation
0 references
divide and conquer
0 references
graph isomorphism
0 references
graphs
0 references
group theory
0 references
0.8671332597732544
0 references
0.8364105224609375
0 references
0.8223027586936951
0 references
0.7812206745147705
0 references
0.780243992805481
0 references
