The query complexity of graph isomorphism: bypassing distribution testing lower bounds (Q5230286)
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: The query complexity of graph isomorphism: bypassing distribution testing lower bounds |
scientific article; zbMATH DE number 7096993
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The query complexity of graph isomorphism: bypassing distribution testing lower bounds |
scientific article; zbMATH DE number 7096993 |
Statements
The query complexity of graph isomorphism: bypassing distribution testing lower bounds (English)
0 references
22 August 2019
0 references
graph isomorphism
0 references
property testing
0 references
query complexity
0 references
sampling
0 references
0.8301405310630798
0 references
0.7622818350791931
0 references
0.7540788054466248
0 references
0.7475699782371521
0 references
0.7464664578437805
0 references
