Abstract
The group isomorphism problem consists in deciding whether two input groups G/sup 1/ and G/sup 2/ given by their multiplication tables are isomorphic. We first give a 2-round Arthur-Merlin protocol for the group non-isomorphism problem such that on input groups (G/sup 1/, G/sup 2/) of size n, Arthur uses O(log/sup 6/ n) random bits and Merlin uses O(log/sup 2/ n) nondeterministic bits. We derandomize this protocol for the case of solvable groups showing the following two results: (a) We give a uniform NP machine for solvable group non-isomorphism, that works correctly on all but 2/sup polylog(n)/ inputs of any length n. Furthermore, this NP machine is always correct when the input groups are nonisomorphic. The NP machine is obtained by an unconditional derandomization of the AM protocol. (b) Under the assumption that EXP /spl nsube/ i.o.PSPACE we get a complete derandomization of the above AM protocol. Thus, EXP /spl nsube/ i.o.PSPACE implies that group isomorphism for solvable groups is in NP /spl cap/ coNP.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
