The Parallel Complexity of the Abelian Permutation Group Membership Problem. McKenzie, P. & Cook, S. A. In Proceedings of Foundations of Computer Science (FOCS), pages 154-161, 1983.
The Parallel Complexity of the Abelian Permutation Group Membership Problem [link]Paper  bibtex   
@inproceedings{ dblp4098730,
  title = {The Parallel Complexity of the Abelian Permutation Group Membership Problem},
  author = {Pierre McKenzie and Stephen A. Cook},
  author_short = {McKenzie, P. and Cook, S. A.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {1983},
  key = {dblp4098730},
  id = {dblp4098730},
  biburl = {http://www.dblp.org/rec/bibtex/conf/focs/McKenzieC83},
  url = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1983.74},
  conference = {FOCS},
  pages = {154-161},
  text = {FOCS 1983:154-161},
  booktitle = {Proceedings of Foundations of Computer Science (FOCS)}
}

Downloads: 0