A Nonadaptive NC Checker for Permutation Group Intersection

In this paper we design a nonadaptive NC checker for permutation group intersection, sharpening a result from Blum and Kannan 3]. This is a consequence of two results. First we show that a nontrivial permutation in the intersection of two given permutation groups (described by lists of generators) can be computed by an NC algorithm with one round of parallel queries to the Group Intersection problem. Next we design a two-round interactive proof system for the complement of the Group Intersection problem, for which the honest prover can be simulated by an NC algorithm with one round of parallel queries to Group Intersection. As a consequence we also have nonadaptive NC checkers for some related group-theoretic problems. On the technical side, we de ne a generalization of wreath products of permutation groups. This product plays a crucial role in the design of the nonadaptive checkers. 1 

• Type: Conference
• Year: 1997
• Where: COCO
• Authors: Vikraman Arvind, Jacobo Torán
• Keywords: Algorithms, COCO 1997, Group Intersection, Nonadaptive Nc Checkers, Permutation Groups