Journal article
Combinatorial problems raised from 2-semilattices
- Abstract:
-
The Constraint Satisfaction Problem (CSP) provides a general framework for many combinatorial problems. In [A.A. Bulatov, A.A. Krokhin, P.G. Jeavons, Classifying the complexity of constraints using finite algebras, SIAM J. Comput. 34 (3) (2005) 720–742; P.G. Jeavons, On the algebraic structure of combinatorial problems, Theoret. Comput. Sci. 200 (1998) 185–204] and then in [A.A. Bulatov, P.G. Jeavons, Algebraic structures in combinatorial problems, Technical Report MATH-AL-4-2001, Technisc...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Version of record, pdf, 203.4KB)
-
- Publisher copy:
- 10.1016/j.jalgebra.2004.07.044
Authors
Bibliographic Details
- Publisher:
- Elsevier Publisher's website
- Journal:
- Journal of Algebra Journal website
- Volume:
- 298
- Issue:
- 2
- Pages:
- 321-339
- Publication date:
- 2006-04-01
- DOI:
- ISSN:
-
0021-8693
Item Description
- Language:
- English
- Keywords:
- Subjects:
- UUID:
-
uuid:4c35dcb3-e436-4144-a4bd-b3c19915165f
- Local pid:
- ora:8675
- Deposit date:
- 2014-06-23
Related Items
Terms of use
- Copyright holder:
- Elsevier Inc
- Copyright date:
- 2006
- Notes:
- Copyright 2006 Elsevier B.V. All rights reserved. Re-use of this article is permitted in accordance with the Terms and Conditions set out at http://www.elsevier.com/open-access/userlicense/1.0/
- Licence:
- Other
If you are the owner of this record, you can report an update to it here: Report update to this record