External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

The Parallel Complexity of the Abelian Permutation Group Membership Problem

Pierre McKenzie, Stephen A. Cook. The Parallel Complexity of the Abelian Permutation Group Membership Problem. In 24th Annual Symposium on Foundations of Computer Science, 7-9 November 1983, Tucson, Arizona, USA. pages 154-161, IEEE, 1983.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.

runs on