The complexity of modular graph automorphism (Q2706110)
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 complexity of modular graph automorphism |
scientific article; zbMATH DE number 1578751
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of modular graph automorphism |
scientific article; zbMATH DE number 1578751 |
Statements
19 March 2001
0 references
graph isomorphism
0 references
graph automorphism
0 references
decision problems
0 references
search problems
0 references
IP protocols
0 references
program checking
0 references
0.91345316
0 references
0.9087574
0 references
0 references
0.90025115
0 references
0.89931583
0 references
0.8860249
0 references
0.8834445
0 references
0 references
The complexity of modular graph automorphism (English)
0 references
