Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style
icon Submit Paper


RSS-Feed
REPORTS > DETAIL:

Paper:

TR04-097 | 2nd November 2004 00:00

Malt'sev Constraints made Simple

Contact
Add Comment
RSS-Feed




TR04-097 Authors: Víctor Dalmau
Publication: 12th November 2004 16:08
Downloads: 2791
Keywords: 


Abstract:

We give in this paper a different and simpler proof of the tractability of Mal'tsev contraints.


ISSN 1433-8092 | Imprint