Improved Lowness Results for Solvable Black-box Group Problems

In order to study the complexity of computational problems that arise from group theory in a general framework, Babai and Szemer edi [4, 2] introduced the theory of black-box groups. They proved that several problems over black-box groups are in the class NP\co-AM, thereby implying that these problems are low (powerless as oracle) for p 2 and hence cannot be complete for NP unless the polynomial hierarchy collapses. In [1], Arvind and Vinodchandran study the counting complexity of a number of computational problems over solvable groups. Using a constructive version of a fundamental structure theorem about nite abelian groups and a randomized algorithm from [3] for computing generator sets for the commutator series of any solvable group, they prove that these problems are in randomized versions of low complexity counting classes like SPP and LWPP and hence low for the class PP. In this paper, we improve the upper bounds of [1] for these problems. More precisely, w..