-
1
-
-
26844575981
-
The complex-ity of satisfiability problems: Refining Schaefer’s theorem
-
E. Allender, M. Bauland, N. Immerman, H. Schnoor, and H. Vollmer. The complex-ity of satisfiability problems: Refining Schaefer’s theorem. In Proc. 30th Math. Found. Of Comp. Sci. (MFCS’05), pages 71-82, 2005.
-
(2005)
Proc. 30Th Math. Found. Of Comp. Sci. (MFCS’05)
, pp. 71-82
-
-
Allender, E.1
Bauland, M.2
Immerman, N.3
Schnoor, H.4
Vollmer, H.5
-
3
-
-
84974555632
-
Constraint satisfaction problems and finite algebras
-
A. Bulatov, A. Krokhin, P. Jeavons. Constraint satisfaction problems and finite algebras. In ICALP’00, volume 1853 of LNCS, 272-282, 2000.
-
(2000)
ICALP’00, Volume 1853 of LNCS
, pp. 272-282
-
-
Bulatov, A.1
Krokhin, A.2
Jeavons, P.3
-
4
-
-
33750042019
-
The Complexity of Constraint Languages
-
(F. Rossi, P. van Beek, T. Walsh eds.), chapter 8, Elsevier
-
D. Cohen and P. G. Jeavons. The Complexity of Constraint Languages, in Handbook of Con-straint Programming (F. Rossi, P. van Beek, T. Walsh eds.), chapter 8, Elsevier, 2006, 978 pp.
-
(2006)
Handbook of Con-Straint Programming
, pp. 978
-
-
Cohen, D.1
Jeavons, P.G.2
-
5
-
-
69949162338
-
Linear Datalog and bounded path duality of relational structures
-
V. Dalmau. Linear Datalog and bounded path duality of relational structures. Logical Methods in Computer Science, 1(1), 2005.
-
(2005)
Logical Methods in Computer Science
, vol.1
, Issue.1
-
-
Dalmau, V.1
-
6
-
-
84957041924
-
Constraint satisfaction, bounded treewidth, and finite-variable logics
-
V. Dalmau, P. Kolaitis, M. Vardi. Constraint satisfaction, bounded treewidth, and finite-variable logics, in Constraint Programming ’02, (LNCS 2002) 310-326, 2002.
-
(2002)
Constraint Programming ’02, (LNCS 2002)
, pp. 310-326
-
-
Dalmau, V.1
Kolaitis, P.2
Vardi, M.3
-
8
-
-
0027225065
-
Monotone monadic SNP and constraint satisfaction
-
San Diego, California
-
T. Feder, M. Y. Vardi, Monotone monadic SNP and constraint satisfaction, in Proceedings of the 25rd Annual ACM Symposium on Theory of Computing (STOC), San Diego, California, (1993), 612-622.
-
(1993)
Proceedings of the 25Rd Annual ACM Symposium on Theory of Computing (STOC)
, pp. 612-622
-
-
Feder, T.1
Vardi, M.Y.2
-
9
-
-
0032057865
-
The Computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory
-
T. Feder, M. Y. Vardi. The Computational structure of monotone monadic SNP and constraint satisfaction: a study through datalog and group theory. SIAM Journal of Computing 28, (1998), 57-104.
-
(1998)
SIAM Journal of Computing
, vol.28
, pp. 57-104
-
-
Feder, T.1
Vardi, M.Y.2
-
10
-
-
0001110897
-
On the algebraic structure of combinatorial problems
-
P. Jeavons. On the algebraic structure of combinatorial problems Theoret. Comput. Sci. 200 no. 1-2, 185-204, 1998.
-
(1998)
Theoret. Comput. Sci
, vol.200
, Issue.1-2
, pp. 185-204
-
-
Jeavons, P.1
-
11
-
-
38149070894
-
Universal algebra and hardness results for constraint satisfaction prob-lems
-
B. Larose and P. Tesson. Universal algebra and hardness results for constraint satisfaction prob-lems. ICALP 2007, 267-278.
-
(2007)
ICALP
, pp. 267-278
-
-
Larose, B.1
Tesson, P.2
-
12
-
-
17744411843
-
Duality theorems for finite structures (Characterising gaps and good char-acterisations)
-
J. Nešetřil, C. Tardif. Duality theorems for finite structures (characterising gaps and good char-acterisations). J. Combin. Theory Ser. B 80, 2000, 80-97.
-
(2000)
J. Combin. Theory Ser. B
, vol.80
, pp. 80-97
-
-
Nešet, J.1
Řiltardif, C.2
-
13
-
-
33751171304
-
Short answers to exponentially long questions: Extremal aspects of homo-morphism duality
-
J. Nešetřil, C. Tardif. Short answers to exponentially long questions: extremal aspects of homo-morphism duality. SIAM J. Discrete Math. 19, 2005, 914-920
-
(2005)
SIAM J. Discrete Math
, vol.19
, pp. 914-920
-
-
Nešet, J.1
Řiltardif, C.2
-
15
-
-
0018053728
-
The complexity of satisfiability problems
-
T. J. Schaefer. The complexity of satisfiability problems. In Proc. 10th ACM STOC, pages 216-226, 1978.
-
(1978)
Proc. 10Th ACM STOC
, pp. 216-226
-
-
Schaefer, T.J.1
|