Parallel complexity of the Abelian permutation group membership problem
Conference
·
OSTI ID:5083514
It is shown that the permutation group membership problem can be solved in depth (logn)/sup 3/ on a Monte Carlo Boolean circuit of polynomial size in the restricted case in which the group is Abelian. It is also shown that this restricted problem is nc/sup 1/-hard for nspace(logn). 22 references.
- OSTI ID:
- 5083514
- Country of Publication:
- United States
- Language:
- English
Similar Records
The parallel complexity of Abelian permutation group problems
The Boolean Isomorphism problem
Characterizations of parallel complexity classes
Journal Article
·
Thu Oct 01 00:00:00 EDT 1987
· SIAM J. Comput.; (United States)
·
OSTI ID:5793262
The Boolean Isomorphism problem
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:457672
Characterizations of parallel complexity classes
Thesis/Dissertation
·
Tue Dec 31 23:00:00 EST 1985
·
OSTI ID:7245029