Satisfiability of systems of equations over finite monoids

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2136, Issue , 2001, Pages 537-547

  Moore, Cristopher ^a   Tesson, Pascal ^b   Thérien, Denis ^b  

^a UNIVERSITY OF NEW MEXICO   (United States)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC;

ABELIAN GROUP; CONSTRAINT SATISFIABILITY; DIRECT PRODUCT; FINITE MONOID; NP COMPLETE; RIGHT-HAND SIDES; SATISFIABILITY; SYSTEMS OF EQUATIONS;

GROUP THEORY;

EID: 84862484445     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44683-4_47     Document Type: Conference Paper

References (14)

1. D. A. M. Barrington and D. Thérien. Finite monoids and the fine structure of NC1. Journal of the ACM, 35(4):941-952, Oct. 1988.
2. D. M. Barrington, P. McKenzie, C. Moore, P. Tesson, and D. Thérien. Equation satisfiability and program satisfiability for finite monoids. In MFCS’00, pages 172-181, 2000.
3. V. Dalmau. Computational Complexity of Problems over Generalized Formula. PhD thesis, Universita Politécnica de Catalunya, 2000.
4. S. Eilenberg. Automata, Languages and Machines, volume B. Academic Press, 1976..
5. T. Feder and M. Y. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory. SIAM Journal on Computing, 28(1):57-104, 1999.
6. M. Goldmann and A. Russell. The complexity of solving equations over finite groups. In Proc. 14th Conf. on Computational Complexity, pages 80-86, 1999.
7. Hertrampf, Lautemann, Schwentick, Vollmer, and Wagner. On the power of polynomial time bit-reductions. In Conf. on Structure in Complexity Theory, 1993.
8. P. Jeavons, D. Cohen, and M. Gyssens. Closure properties of constraints. J. ACM, 44(4):527-548, 1997.
9. O. Klima. Private communication, 2001.
10. J. Pearson and P. Jeavons. A survey of tractable constraint satisfaction problems. Technical Report CSD-TR-97-15, University of London, 1997. Available at http://www.dcs.rhbnc.ac.uk/research/.
11. J.-E. Pin. Varieties of formal languages. North Oxford Academic Publishers Ltd, London, 1986.
12. J.-F. Raymond, P. Tesson, and D. Thérien. An algebraic approach to communication complexity. Lecture Notes in Computer Science, 1443:29-40, 1998.
13. T. J. Schaefer. The complexity of satisfiability problems. In Proc. 10th ACM STOC, pages 216-226, 1978.
14. M. P. Schützenberger. Sur le produit de concaténation non ambigu. Semigroup Forum, 13:47-75, 1976.