Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Graph Isomorphism and Circuit Size   It is well-known [KST93] that the complexity of the Graph Automorphism
problem is characterized by a special case of Graph Isomorphism, where the
input graphs satisfy the "promise" of being rigid (that is, having no
nontrivial automorphisms). In this brief note, we observe that the reduction of
Graph Automorphism to the Rigid Graph Ismorphism problem can be accomplished
even using Grollman and Selman's notion of a "smart reduction".

17
The categories of this paper are: q-fin
22
The categories of this paper are: chao-dyn
7
The categories of this paper are: hep-th
2
The categories of this paper are: math
14
The categories of this paper are: math-ph
33
The categories of this paper are: plasm-ph
36
The categories of this paper are: cmp-lg
11
The categories of this paper are: hep-lat
20
The categories of this paper are: acc-phys
8
The categories of this paper are: hep-ex
23
The categories of this paper are: solv-int
29
The categories of this paper are: funct-an
12
The categories of this paper are: nucl-th
31
The categories of this paper are: ao-sci
26
The categories of this paper are: bayes-an
30
The categories of this paper are: q-alg