• DocumentCode
    2181432
  • Title

    The parallel complexity of the abelian permutation group membership problem

  • Author

    Mckenzie, Pierre ; Cook, Stephen A.

  • fYear
    1983
  • fDate
    7-9 Nov. 1983
  • Firstpage
    154
  • Lastpage
    161
  • Abstract
    We show that the permutation group membership problem can be solved in depth (logn)3 on a Monte Carlo Boolean circuit of polynomial size in the restricted case in which the group is abelian. We also show that this restricted problem is NC1-hard for NSPACE(logn).
  • Keywords
    Circuits; Computer science; Concurrent computing; Councils; Linear programming; Monte Carlo methods; Parallel algorithms; Polynomials; Testing; Voting;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1983., 24th Annual Symposium on
  • Conference_Location
    Tucson, AZ, USA
  • ISSN
    0272-5428
  • Print_ISBN
    0-8186-0508-1
  • Type

    conf

  • DOI
    10.1109/SFCS.1983.74
  • Filename
    4568072
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2181432