Advertisement

Equation Satisfiability and Program Satisfiability for Finite Monoids

  • David Mix Barrington
  • Pierre McKenzie
  • Cris Moore
  • Pascal Tesson
  • Denis Thérien
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1893)

Abstract

We study the computational complexity of solving equations and of determining the satisfiability of programs over a fixed finite monoid. We partially answer an open problem of [4] by exhibiting quasi-polynomial time algorithms for a subclass of solvable non-nilpotent groups and relate this question to a natural circuit complexity conjecture. In the special case when M is aperiodic, we show that PROGRAM SATISFIABILITY is in P when the monoid belongs to the variety DA and is NP-complete otherwise. In contrast, we give an example of an aperiodic outside DA for which EQUATION SATISFIABILITY is computable in polynomial time and discuss the relative complexity of the two problems. We also study the closure properties of classes for which these problems belong to P and the extent to which these fail to form algebraic varieties.

Keywords

Polynomial Time Nilpotent Group Homomorphic Image Solvable Group Wreath Product 
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. 1.
    D. A. Barrington. Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. J. Comput. Syst. Sci., 38(1):150–164, Feb. 1989.Google Scholar
  2. 2.
    D. A. M. Barrington, H. Straubing, and D. Thérien. Non-uniform automata over groups. Information and Computation, 89(2):109–132, Dec. 1990.Google Scholar
  3. 3.
    S. Eilenberg. Automata, Languages and Machines. Academic Press, 1976.Google Scholar
  4. 4.
    M. Goldmann and A. Russell. The complexity of solving equations over finite groups. In Proceedings of the 14th Annual IEEE Conference on Computational Complexity (CCC-99), pages 80–86, 1999.Google Scholar
  5. 5.
    P. McKenzie, P. Péladeau, and D. Thérien. NC1: The automata theoretic viewpoint. Computational Complexity, 1:330–359, 1991.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    P. Péladeau and D. Thérien. Sur les langages reconnus par des groupes nilpotents. Compte-rendus de l’Académie des Sciences de Paris, pages 93–95, 1988.Google Scholar
  7. 7.
    J.-É. Pin, H. Straubing, and D. Thérien. Locally trivial categories and unambiguous concatenation. J. Pure Applied Algebra, 52:297–311, 1988.zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • David Mix Barrington
    • 1
  • Pierre McKenzie
    • 2
  • Cris Moore
    • 3
  • Pascal Tesson
    • 4
  • Denis Thérien
    • 4
  1. 1.Dept. of Computer ScienceUniversity of MassachussetsUSA
  2. 2.Dept. d’Informatique et de Recherche OpérationnelleUniversité de MontréalMontréalCanada
  3. 3.Dept. of Computer ScienceUniversity of New MexicoUSA
  4. 4.School of Computer ScienceMcGill UniversityUSA

Personalised recommendations