Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR04-097 | 2nd November 2004 00:00

Malt'sev Constraints made Simple

RSS-Feed




TR04-097
Authors: VĂ­ctor Dalmau
Publication: 12th November 2004 16:08
Downloads: 1083
Keywords: 


Abstract:

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



ISSN 1433-8092 | Imprint