Advertisement

Testing membership in commutative transformation semigroups

  • Martin Beaudry
Complexity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 267)

Abstract

Given a finite set X of points, a finite set of commuting transformations over X (generators), and another transformation f over X, we analyze the complexity of the problem of deciding whether f can be obtained by composition of the generators. We show that the complexity varies with the threshold of the semigroup: polynomial-time (NC3 in parallel) with threshold zero or one, and NP-complete otherwise.

Keywords

Permutation Group Commutative Semigroup Parallel Complexity Membership Problem Transformation Semigroup 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Bor]
    A. Borodin On relating time and space to size and depth, SIAM J. Comp. 6 (1977) pp. 733–744.Google Scholar
  2. [CFL]
    A.K.Chandra, S.Fortune, R.Lipton Unbounded fan-in circuits and associative functions, Proc. 15th. ACM STOC Symposium (1983) pp. 52–60.Google Scholar
  3. [Cook]
    S.A. Cook The Taxonomy of Problems with Fast Parallel Algorithms, Information and Control, 64 (1985) pp. 2–22.CrossRefGoogle Scholar
  4. [FHL]
    M.Furst, J.Hopcroft, E.Luks Polynomial-Time Algorithms for Permutation Groups Proc. 21st. IEEE FOCS Symposium (1980) pp. 36–41.Google Scholar
  5. [GJ]
    M.Garey, D.Johnson Computers and Intractability, a Guide to the Theory of NP-Completeness, Freeman (1979).Google Scholar
  6. [Jon]
    N.D. Jones Space-bounded Reducibility among Combinatorial Problems, JCSS 11 (1975) pp. 68–75.Google Scholar
  7. [Koz]
    D.Kozen Lower Bounds for natural proof systems, Proc. 18th. IEEE FOCS Symposium (1977) pp. 254–266.Google Scholar
  8. [Lall]
    G.Lallement Semigroups and Combinatorial Applications, Addison-Wesley (1979).Google Scholar
  9. [LMK]
    E.Luks, P.McKenzie Fast Parallel Computation with Permutation Groups, Proc. 26th. IEEE FOCS Symposium (1985) pp. 505–514.Google Scholar
  10. [McC]
    P.McKenzie, S.A.Cook The parallel complexity of the Abelian permutation group membership problem, Proc. 24th. IEEE FOCS Symposium (1983) pp.154–161.Google Scholar
  11. [McK]
    P.McKenzie Parallel Complexity and Permutation Groups, Ph.D. Thesis, University of Toronto (1984).Google Scholar
  12. [Pin]
    J.E.Pin Variétés de langages formels, Masson (1984).Google Scholar
  13. [Sims]
    C.Sims Computational Problems in Abstract Algebra, (John Leech, Ed.) Pergamon Press (1970) pp. 176–177.Google Scholar
  14. [Wie]
    H.Wielandt Finite Permutation Groups, Academic Press (1964).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Martin Beaudry
    • 1
  1. 1.School of Computer ScienceMcGill UniversityMontréalCanada

Personalised recommendations