A note on decision versus search for graph automorphism

We show that for any graph G, k non-trivial automorphisms of G-if as many exist-can be computed in time |G|/sup O(log k/) with nonadaptive queries to GA, the decision problem for Graph Automorphism. As a consequence we show that some problems related to GA and GI are polynomial-time truth-table equivalent to GA.