On the complexity of identifying strongly regular graphs (Q6072032)
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: On the complexity of identifying strongly regular graphs |
scientific article; zbMATH DE number 7771724
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of identifying strongly regular graphs |
scientific article; zbMATH DE number 7771724 |
Statements
29 November 2023
0 references
isomorphism problems
0 references
limited nondeterminism
0 references
0 references
0 references
0 references
0.8113341331481934
0 references
0.7681695818901062
0 references
0.7672778367996216
0 references
0.7621715068817139
0 references
