Name
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. |
Year | DOI | Venue |
|---|---|---|
1986 | 10.1007/BF00264315 | Acta Inf. |
Keywords | Field | DocType |
Information System,Operating System,Data Structure,Communication Network,Information Theory | Permutation graph,Discrete mathematics,Abelian group,Free abelian group,Combinatorics,Elementary abelian group,Cyclic permutation,Permutation group,Bit-reversal permutation,Rank of an abelian group,Mathematics | Journal |
Volume | Issue | ISSN |
23 | 6 | 0001-5903 |
Citations | PageRank | References |
1 | 0.43 | 6 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| C. S. Iliopoulos | 1 | 52 | 6.67 |