Monte Carlo circuits for the abelian permutation group intersection problem

Document Type

Article

Publication Date

11-1-1986

Abstract

We show that the problem of computing a basis for an abelian transitive permutation group is in N Ck and also we show that the problem of computing a basis for an abelian permutation group and the problem of computing the intersection of two abelian groups acting on n points, can be solved in depth (log n)k on a Monte Carlo Boolean circuit of polynomial size. Moreover the latter two problems are shown to be in N Ck in the restricted case of bounded number of generators. © 1986 Springer-Verlag.

Identifier

0022868514 (Scopus)

Publication Title

Acta Informatica

External Full Text Location

https://doi.org/10.1007/BF00264315

e-ISSN

14320525

ISSN

00015903

First Page

697

Last Page

705

Issue

6

Volume

23

This document is currently not available here.

Share

COinS