Pages that link to "Item:Q675067"
From MaRDI portal
The following pages link to A note on decision versus search for graph automorphism (Q675067):
Displaying 6 items.
- Computational complexity of computing a partial solution for the graph automorphism problems (Q1019184) (← links)
- On the reducibility of sets inside NP to sets with low information content (Q1765294) (← links)
- Conflict Anticipation in the Search for Graph Automorphisms (Q2891455) (← links)
- Relating Complete and Partial Solution for Problems Similar to Graph Automorphism (Q3525603) (← links)
- Some natural decision problems in automatic graphs (Q3570167) (← links)
- On finding the number of graph automorphisms (Q4259996) (← links)