The class of problems (Karp-)reducible to counting the number of automorphisms of a graph.
Counterpart of GA.
No class.