The complexity of the extendibility problem for finite posets

SIAM Journal on Discrete Mathematics

Volumn 17, Issue 1, 2003, Pages 114-121

  Larose, Benoit ^a   Zádori, László ^b  

^a Gina Cody School of Engineering and Computer Science   (Canada)

^b UNIVERSITY OF SZEGED   (Hungary)

Author keywords

Constraint satisfaction problem; Extendibility problem for posets; NP complete; Totally symmetric idempotent and near unanimity operations; Zigzags

Indexed keywords

ALGEBRA; COMPUTATIONAL COMPLEXITY; DECISION THEORY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

CONSTRAINT SATISFACTION PROBLEM; EXTENDIBILITY PROBLEM FOR POSETS; TOTALLY SYMMETRIC IDEMPOTENT AND NEAR UNANIMITY OPERATIONS; ZIGZAGS;

CONSTRAINT THEORY;

EID: 10744220609     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480101389478     Document Type: Article

References (17)

1. A. A. BULATOV, P. G. JEAVONS, AND A. A. KROKHIN, Constraint satisfaction problems and finite algebras, in Proceedings of the 27th International Colloquium on Automata, Languages and Programming, ICALP'00, Lecture Notes in Comput. Sci. 1853, Springer-Verlag, Berlin, 2000, pp. 272-282.
2. E. COROMINAS, Sur les ensembles ordonnés projectif et la properiétré du point fixe, C. R. Acad. Sci. Paris Sér. I Math., 311 (1990), pp. 199-204.
3. V. DALMAU AND J. PEARSON, Closure functions and width 1 problems, in Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming, CP'99, Lecture Notes in Comput. Sci. 1713, Springer-Verlag, Berlin, 1999, pp. 159-173.
4. B. A. DAVEY, J. B. NATION, R. N. MCKENZIE, AND P. P. PÁLFY, Braids and their monotone clones, Algebra Universalis, 32 (1994), pp. 153-176.
5. D. DUFFUS AND T. GODDARD, The complexity of the fixed point property, Order, 13 (1996), pp. 209-218.
6. T. FEDER AND M. Y. VARDI, The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory, SIAM J. Comput., 28 (1998), pp. 57-104.
7. S. HAZAN, Two properties of protective orders, Order, 9 (1992), pp. 233-238.
8. D. HOBBY AND R. MCKENZIE, The Structure of Finite Algebras, Contemp. Math. 76, AMS, Providence, RI, 1988.
9. P. JEAVONS, On the algebraic structure of combinatorial problems, Theoret. Comput. Sci., 200 (1998), pp. 185-204.
10. G. KUN AND Cs. SZABÓ, Order varieties and monotone retractions of finite posets, Order, 18 (2001), pp. 79-88.
11. B. LAROSE, Minimal automorphic posets and the projection property, Internat. J. Algebra Comput., 5 (1995), pp. 65-80.
12. B. LAROSE AND L. ZÁDORI, Algebraic properties and dismantlability of finite posets, Discrete Math., 163 (1997), pp. 89-99.
13. V. PRATT AND J. TIURYN, Satisfiability of inequalities in a poset, Fund, Inform., 28 (1996), pp. 165-182.
14. I. RIVAL, A fixed point theorem for finite partially ordered seta, J. Combin. Theory Ser. A, 21 (1976), pp. 309-318.
15. T. J. SCHAEFER, The complexity of the satisfiability problems, in Proceedings of the 10th ACM Symposium on the Theory of Computing (STOC), 1978, pp. 216-226.
16. Cs. SZABÓ AND L. ZÁDORI, Idempotent totally symmetric operations on finite posets, Order, 18 (2001), pp. 39-47.
17. W. TAYLOR, Varieties obeying homotopy laws, Canad. J. Math., 29 (1977), pp. 498-527.