Computational complexity of computing a partial solution for the graph automorphism problems (Q1019184): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 22:52, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computational complexity of computing a partial solution for the graph automorphism problems |
scientific article |
Statements
Computational complexity of computing a partial solution for the graph automorphism problems (English)
0 references
28 May 2009
0 references
computational complexity
0 references
reducibility
0 references
graph automorphism
0 references
partial solution
0 references