The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
Abstract
This paper starts with the project of finding a large subclass of NP which exhibits a dichotomy. The approach is to find this subclass via syntactic prescriptions. While the paper does not achieve this goal, it does isolate a class (of problems specified by) "monotone monadic SNP without inequality" which may exhibit this dichotomy. We justify the placing of all these restrictions by showing, essentially using Ladner's theorem, that classes obtained by using only two of the above three restrictions do not show this dichotomy. We then explore the structure of this class. We show that all problems in this class reduce to the seemingly simpler class CSP. We divide CSP into subclasses and try to unify the collection of all known polytime algorithms for CSP problems and extract properties that make CSP problems NP-hard. This is where the second part of the title, "a study through Datalog and group theory," comes in. We present conjectures about this class which would end in showing the dichotomy.
MSC codes
Keywords
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
Stefan Arnborg, Jens Lagergren, Detlef Seese, Easy problems for tree‐decomposable graphs, J. Algorithms, 12 (1991), 308–340
2.
M. Aschbacher, Finite Group Theory, Cambridge Stud. Adv. Math. 10, Cambridge University Press, Cambridge, UK, 1986.
3.
Michael Aschbacher, Near subgroups of finite groups, J. Group Theory, 1 (1998), 113–129
4.
F. Afrati and S. S. Cosmadakis, Expressiveness of restricted recursive queries, in Proc. 21st ACM Symp. on Theory of Computing, ACM, New York, 1989, pp. 113–126.
5.
F. Afrati, S. S. Cosmadakis, and M. Yannakakis, On Datalog vs. polynomial time, in Proc. 10th ACM SIGACT‐SIGMOD‐SIGART Symp. on Principles of Database Systems, ACM, New York, 1991, pp. 13–25.
6.
L. Babai, Monte Carlo Algorithms in Graph Isomorphism Testing, manuscript, 1979.
7.
Roman Bačík, Sanjeev Mahajan, Semidefinite programming and its applications to NP problems, Lecture Notes in Comput. Sci., Vol. 959, Springer, Berlin, 1995, 566–575
8.
Jørgen Bang‐Jensen, Pavol Hell, The effect of two cycles on the complexity of colourings by directed graphs, Discrete Appl. Math., 26 (1990), 1–23
9.
Hans Bodlaender, Polynomial algorithms for graph isomorphism and chromatic index on partial ‐trees, J. Algorithms, 11 (1990), 631–643
10.
R. Dechter, Constraint networks, in Encyclopedia of Artificial Intelligence, 1992, pp. 276–285.
11.
P. Erdös, Graph theory and probability, Canad. J. Math., 11 (1959), 34–38
12.
T. Etter, Process, system, causality, and quantum mechanics – a psychoanalysis of animal faith, Internat. J. General Systems (Special Issue on General Systems and the Emergence of Physical Structure from Information Theory).
13.
T. Etter, Quantum mechanics as a branch of mereology, extended abstract,Phys. Comp., 116 (1995).
14.
Ronald Fagin, Generalized first‐order spectra and polynomial‐time recognizable sets, Amer. Math. Soc., Providence, R.I., 1974, 0–0, 43–73. SIAM‐AMS Proc., Vol. VII
15.
Tomás Feder, Stable networks and product graphs, Mem. Amer. Math. Soc., 116 (1995), 0–0xii+223
16.
T. Feder, Removing Inequalities and Negation for Homomorphism‐Closed Problems, manuscript.
17.
T. Feder, Classification of Homomorphisms to Oriented Cycles and of ‐Partite Satisfiability Problems, manuscript.
18.
T. Feder and P. Hell, List Problems for Reflexive Graphs, manuscript.
19.
T. Feder and P. Hell, Homomorphism Problems on Graphs with Some Self‐Loops, manuscript.
20.
U. Feige and L. Lovász, Two‐prover one‐round proof systems: Their power and their problems, 24th Annual ACM Symp. on Theory of Computing, ACM, New York, 1994, pp. 422–431.
21.
Merrick Furst, John Hopcroft, Eugene Luks, Polynomial‐time algorithms for permutation groups, IEEE, New York, 1980, 36–1
22.
David Goldschmidt, 2‐fusion in finite groups, Ann. of Math. (2), 99 (1974), 70–117
23.
Wolfgang Gutjahr, Emo Welzl, Gerhard Woeginger, Polynomial graph‐colorings, Discrete Appl. Math., 35 (1992), 29–45
24.
Pavol Hell, Jaroslav Nešetřil, On the complexity of ‐coloring, J. Combin. Theory Ser. B, 48 (1990), 92–110
25.
P. Hell, J. Nešetřil, X. Zhu, Duality and polynomial testing of tree homomorphisms, Trans. Amer. Math. Soc., 348 (1996), 1281–1297
26.
P. Hell, J. Nešetřil, X. Zhu, Complexity of tree homomorphisms, Discrete Appl. Math., 70 (1996), 23–36
27.
P. Hell, J. Nešetřil, X. Zhu, Duality of graph homomorphisms, Bolyai Soc. Math. Stud., Vol. 2, János Bolyai Math. Soc., Budapest, 1996, 271–282
28.
Pavol Hell, Xu Zhu, Homomorphisms to oriented paths, Discrete Math., 132 (1994), 107–114
29.
Pavol Hell, Xu Zhu, The existence of homomorphisms to oriented cycles, SIAM J. Discrete Math., 8 (1995), 208–222
30.
G. G. Hillebrand, P. C. Kanellakis, H. G. Mairson, and M. Y. Vardi, Tools for Datalog boundedness, in Proc. 10th ACM SIGACT‐SIGMOD‐SIGART Symp. on Principles of Database Systems, ACM, New York, 1991, pp. 1–12.
31.
Christoph Hoffmann, Group‐theoretic algorithms and graph isomorphism, Lecture Notes in Computer Science, Vol. 136, Springer‐Verlag, 1982viii+311
32.
P. G. Kolaitis and M. Y. Vardi, The decision problem for the probabilities of higher‐order properties, in Proc. 19th ACM Symp. on Theory of Computing, 1987, pp. 425–435.
33.
P. G. Kolaitis and M. Y. Vardi, On the expressive power of Datalog: Tools and a case study, in Proc. 9th ACM SIGACT‐SIGMOD‐SIGART Symp. on Principles of Database Systems, ACM, New York, 1990, pp. 61–71.
34.
V. Kumar, Algorithms for constraint‐satisfaction problems, AI Magazine, 13 (1992), pp. 32–44.
35.
R. E. Ladner, On the structure of polynomial time reducibility, J. Assoc. Comput. Mach., 22 (1975), pp. 155–171.
36.
V. S. Lakshmanan and A. O. Mendelzon, Inductive pebble games and the expressive power of Datalog, in Proc. 8th ACM SIGACT‐SIGMOD‐SIGART Symp. on Principles of Database Systems, ACM, New York, 1989, pp. 301–310.
37.
Anna Lubiw, Some NP‐complete problems similar to graph isomorphism, SIAM J. Comput., 10 (1981), 11–21
38.
Jiří Matoušek, Robin Thomas, Algorithms finding tree‐decompositions of graphs, J. Algorithms, 12 (1991), 1–22
39.
Ernst Mayr, Ashok Subramanian, The complexity of circuit value and network stability, J. Comput. System Sci., 44 (1992), 302–323
40.
P. Meseguer, Constraint satisfaction problem: An overview, AICOM, 2 (1989), pp. 3–16.
41.
J. C. Mitchell, Coercion and type inference (summary), in Conf. Rec. 11th ACM Symp. on Principles of Programming Languages, ACM, New York, 1984, pp. 175–185.
42.
P. Lincoln and J. C. Mitchell, Algorithmic aspects of type inference with subtypes, in Conf. Rec. 19th ACM Symp. on Principles of Programming Languages, ACM, New York, 1992, pp. 293–304.
43.
M. Wand and P. M. O’Keefe, On the complexity of type inference with coercion, in Conf. on Functional Programming Languages and Computer Architecture, 1989.
44.
Christos Papadimitriou, Mihalis Yannakakis, Optimization, approximation, and complexity classes, J. Comput. System Sci., 43 (1991), 425–440
45.
Vaughan Pratt, Jerzy Tiuryn, Satisfiability of inequalities in a poset, Fund. Inform., 28 (1996), 165–182
46.
A. A. Razborov, Lower bounds on monotone complexity of the logical permanent, Math. Notes Acad. Sci. USSR, 37 (1985), pp. 485–493.
47.
N. Robertson and P. Seymour, Graph minors. II. Algorithmic aspects of tree‐width, J. Algorithms, 7 (1985), pp. 309–322.
48.
Thomas Schaefer, The complexity of satisfiability problems, ACM, New York, 1978, 216–226
49.
E. Tardos, The gap between monotone and non‐monotone circuit complexity is exponential, Combinatorica, 7–4 (1987), pp. 141–142.
50.
J. D. Ullman, Principles of Database and Knowledge‐Base Systems, Vol. I, Computer Science Press, Rockville, MD, 1989.
Information & Authors
Information
Published In
SIAM Journal on Computing
Pages: 57 - 104
ISSN (online): 1095-7111
Copyright
Copyright © 1998 Society for Industrial and Applied Mathematics.
History
Published online: 28 July 2006
MSC codes
Keywords
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- Complexity Classification Transfer for CSPs via Algebraic ProductsSIAM Journal on Computing, Vol. 53, No. 5 | 12 September 2024
- Functors on Relational Structures Which Admit Both Left and Right AdjointsSIAM Journal on Discrete Mathematics, Vol. 38, No. 3 | 3 July 2024
- Solving promise equations over monoids and groupsACM Transactions on Computational Logic | 27 September 2024
- Finite algebras with Hom-sets of polynomial sizeTransactions of the American Mathematical Society, Vol. 21 | 10 September 2024
- Smooth approximations: An algebraic approach to CSPs over finitely bounded homogeneous structuresJournal of the ACM, Vol. 8 | 17 August 2024
- The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-WidthACM Transactions on Algorithms, Vol. 20, No. 3 | 23 May 2024
- Complexity Classification of Counting Graph Homomorphisms Modulo a Prime NumberSIAM Journal on Computing, Vol. 0, No. 0 | 1 July 2024
- Generalisations of matrix partitions: Complexity and obstructionsTheoretical Computer Science, Vol. 1007 | 1 Jul 2024
- A Complexity Dichotomy in Spatial Reasoning via Ramsey TheoryACM Transactions on Computation Theory, Vol. 16, No. 2 | 10 June 2024
- On the complexity of symmetric vs. functional PCSPsACM Transactions on Algorithms | 18 June 2024
- Reasoning on property graphs with graph generating dependenciesInformation Sciences, Vol. 672 | 1 Jun 2024
- Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity BoundsACM Transactions on Algorithms, Vol. 20, No. 2 | 13 February 2024
- Surjective polymorphisms of directed reflexive cyclesAlgebra universalis, Vol. 85, No. 1 | 17 November 2023
- On the Induced Problem for Fixed-Template CSPsSOFSEM 2024: Theory and Practice of Computer Science | 7 February 2024
- Logical Expressibility of Syntactic NL for Complementarity and MaximizationLogic, Language, Information, and Computation | 8 June 2024
- Boolean symmetric vs. functional PCSP dichotomy2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 26 Jun 2023
- The smallest hard treesConstraints, Vol. 28, No. 2 | 25 March 2023
- Gyro-groups, gyro-splittings and co-homologyJournal of Algebra and Its Applications | 21 March 2023
- On the Descriptive Complexity of Temporal Constraint Satisfaction ProblemsJournal of the ACM, Vol. 70, No. 1 | 19 December 2022
- CLAP: A New Algorithm for Promise CSPsSIAM Journal on Computing, Vol. 52, No. 1 | 25 January 2023
- Topology and Adjunction in Promise Constraint SatisfactionSIAM Journal on Computing, Vol. 52, No. 1 | 14 February 2023
- On Guarded Extensions of MMSNPUnity of Logic and Computation | 19 July 2023
- Constraint Satisfaction, Graph Isomorphism, and the Pebbling ComonadSamson Abramsky on Logic and Structure in Computer Science and Beyond | 2 August 2023
- Maximal Digraphs with Respect to Primitive Positive ConstructabilityCombinatorica, Vol. 42, No. S1 | 10 October 2022
- Polyadic sets and homomorphism countingAdvances in Mathematics, Vol. 410 | 1 Dec 2022
- Quantaloidal Approach to Constraint SatisfactionElectronic Proceedings in Theoretical Computer Science, Vol. 372 | 3 November 2022
- Beyond PCSP(1-in-3,NAE)Information and Computation, Vol. 289 | 1 Nov 2022
- A tetrachotomy of ontology-mediated queries with a covering axiomArtificial Intelligence, Vol. 309 | 1 Aug 2022
- QCSP on Reflexive TournamentsACM Transactions on Computational Logic, Vol. 23, No. 3 | 31 Jul 2022
- A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic ELArtificial Intelligence, Vol. 308 | 1 Jul 2022
- An invitation to the promise constraint satisfaction problemACM SIGLOG News, Vol. 9, No. 3 | 1 Jul 2022
- Satisfiability in MultiValued CircuitsSIAM Journal on Computing, Vol. 51, No. 3 | 5 May 2022
- Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial RepresentationsSIAM Journal on Computing, Vol. 51, No. 3 | 19 May 2022
- Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical ComplexityAlgorithmica, Vol. 84, No. 5 | 4 January 2022
- Current Challenges in Infinite-Domain Constraint Satisfaction: Dilemmas of the Infinite Sheep2022 IEEE 52nd International Symposium on Multiple-Valued Logic (ISMVL) | 1 May 2022
- When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction ProblemsSIAM Journal on Computing, Vol. 51, No. 2 | 9 March 2022
- The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other SideSIAM Journal on Computing, Vol. 51, No. 1 | 25 January 2022
- $$(\mathbb {Z},\text {succ},U), (\mathbb {Z},E,U)$$, and Their CSP’sTheory and Applications of Models of Computation | 1 January 2023
- Solving equation systems in ω-categorical algebrasJournal of Mathematical Logic, Vol. 21, No. 03 | 6 January 2021
- The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problemsTheoretical Computer Science, Vol. 892 | 1 Nov 2021
- On rainbow-free colourings of uniform hypergraphsTheoretical Computer Science, Vol. 885 | 1 Sep 2021
- From A to B to ZSemigroup Forum, Vol. 103, No. 1 | 31 March 2021
- Smooth digraphs modulo primitive positive constructability and cyclic loop conditionsInternational Journal of Algebra and Computation, Vol. 31, No. 05 | 24 June 2021
- Reconfiguration of homomorphisms to reflexive digraph cyclesDiscrete Mathematics, Vol. 344, No. 8 | 1 Aug 2021
- Algebraic Approach to Promise Constraint SatisfactionJournal of the ACM, Vol. 68, No. 4 | 14 July 2021
- The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite DomainsACM Transactions on Algorithms, Vol. 17, No. 3 | 31 Jul 2021
- The Complexity of Approximately Counting Retractions to Square-free GraphsACM Transactions on Algorithms, Vol. 17, No. 3 | 31 Jul 2021
- Acyclic orders, partition schemes and CSPs: Unified hardness proofs and improved algorithmsArtificial Intelligence, Vol. 296 | 1 Jul 2021
- Permutation groups with small orbit growthJournal of Group Theory, Vol. 24, No. 4 | 20 January 2021
- Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 29 Jun 2021
- No-Rainbow Problem and the Surjective Constraint Satisfaction Problem2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 29 Jun 2021
- Constraint Satisfaction Problems over Finite Structures2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 29 Jun 2021
- Canonical Polymorphisms of Ramsey Structures and the Unique Interpolation Property2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 29 Jun 2021
- Modern Lower Bound Techniques in Database Theory and Constraint SatisfactionProceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems | 20 June 2021
- Parameterized Counting of Partially Injective HomomorphismsAlgorithmica, Vol. 83, No. 6 | 11 March 2021
- In praise of homomorphismsComputer Science Review, Vol. 40 | 1 May 2021
- Palindromes in finite groups and the Explorer-Director gameInternational Journal of Algebra and Computation, Vol. 31, No. 03 | 25 January 2021
- Fine-Grained Time Complexity of Constraint Satisfaction ProblemsACM Transactions on Computation Theory, Vol. 13, No. 1 | 21 January 2021
- Dismantlability, connectedness, and mixing in relational structuresJournal of Combinatorial Theory, Series B, Vol. 147 | 1 Mar 2021
- Solving CSPs Using Weak Local ConsistencySIAM Journal on Computing, Vol. 50, No. 4 | 27 July 2021
- Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean DichotomySIAM Journal on Computing, Vol. 50, No. 6 | 18 November 2021
- A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNPSIAM Journal on Computing, Vol. 50, No. 4 | 20 August 2021
- Galois Connections for Patterns: An Algebra of Labelled GraphsGraph Structures for Knowledge Representation and Reasoning | 16 March 2021
- Tractable Combinations of Theories via SamplingLogics in Artificial Intelligence | 12 May 2021
- 𝜔-categorical structures avoiding height 1 identitiesTransactions of the American Mathematical Society, Vol. 374, No. 1 | 14 October 2020
- The Dynamic Complexity of Acyclic Hypergraph HomomorphismsGraph-Theoretic Concepts in Computer Science | 20 September 2021
- Using a Min-Cut Generalisation to Go Beyond Boolean Surjective VCSPsAlgorithmica, Vol. 82, No. 12 | 24 June 2020
- A structured view on weighted counting with relations to counting, quantum computation and applicationsInformation and Computation, Vol. 275 | 1 Dec 2020
- Point-Width and Max-CSPsACM Transactions on Algorithms, Vol. 16, No. 4 | 16 September 2020
- Complexity of planar signed graph homomorphisms to cyclesDiscrete Applied Mathematics, Vol. 284 | 1 Sep 2020
- Dichotomies in Ontology-Mediated Querying with the Guarded FragmentACM Transactions on Computational Logic, Vol. 21, No. 3 | 20 February 2020
- On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict WidthProceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 8 July 2020
- Graph homomorphism reconfiguration and frozen H‐coloringsJournal of Graph Theory, Vol. 94, No. 3 | 9 December 2019
- Complexity of correspondence H -colouringsDiscrete Applied Mathematics, Vol. 281 | 1 Jul 2020
- Sparsification of SAT and CSP Problems via Tractable ExtensionsACM Transactions on Computation Theory, Vol. 12, No. 2 | 26 April 2020
- Approximate Counting CSP Seen from the Other SideACM Transactions on Computation Theory, Vol. 12, No. 2 | 13 May 2020
- Emptiness problems for distributed automataInformation and Computation, Vol. 272 | 1 Jun 2020
- Loop conditions for strongly connected digraphsInternational Journal of Algebra and Computation, Vol. 30, No. 03 | 2 December 2019
- Homomorphism Reconfiguration via HomotopySIAM Journal on Discrete Mathematics, Vol. 34, No. 1 | 30 January 2020
- Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems)SIAM Journal on Computing, Vol. 49, No. 2 | 30 March 2020
- Minimum Violation Vertex Maps and Their Applications to Cut ProblemsSIAM Journal on Discrete Mathematics, Vol. 34, No. 4 | 22 October 2020
- The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction ProblemsSIAM Journal on Computing, Vol. 49, No. 6 | 1 December 2020
- Constraint ReasoningA Guided Tour of Artificial Intelligence Research | 8 May 2020
- ASNP: A Tame Fragment of Existential Second-Order LogicBeyond the Horizon of Computability | 24 June 2020
- A Systematic Review of Hyper-Heuristics on Combinatorial Optimization ProblemsIEEE Access, Vol. 8 | 1 Jan 2020
- Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structuresJournal of Mathematical Logic, Vol. 19, No. 02 | 2 October 2019
- Generalized satisfiability problems via operator assignmentsJournal of Computer and System Sciences, Vol. 105 | 1 Nov 2019
- The Complexity of 3-Colouring H-Colourable Graphs2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) | 1 Nov 2019
- Constraint Satisfaction Problems over semilattice block Mal'tsev algebrasInformation and Computation, Vol. 268 | 1 Oct 2019
- A decidable dichotomy theorem on directed graph homomorphisms with non-negative weightscomputational complexity, Vol. 28, No. 3 | 22 April 2019
- The Number of Clones Determined by Disjunctions of Unary RelationsTheory of Computing Systems, Vol. 63, No. 6 | 19 December 2018
- Algebraic approach to promise constraint satisfactionProceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 23 June 2019
- On the approximation resistance of balanced linear threshold functionsProceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 23 June 2019
- CSPs with global modular constraints: algorithms and hardness via polynomial representationsProceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 23 June 2019
- Point-width and Max-CSPs2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 1 Jun 2019
- Promises Make Finite (Constraint Satisfaction) Problems Infinitary2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 1 Jun 2019
- Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems)2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 1 Jun 2019
- Fine-Grained Complexity of Constraint Satisfaction Problems through Partial Polymorphisms: A Survey2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL) | 1 May 2019
- Even Delta-Matroids and the Complexity of Planar Boolean CSPsACM Transactions on Algorithms, Vol. 15, No. 2 | 7 December 2018
- The Complexity of Minimal Inference Problem for Conservative Constraint LanguagesACM Transactions on Computational Logic, Vol. 20, No. 2 | 18 February 2019
- The minimal arity of near unanimity polymorphismsMathematica Slovaca, Vol. 69, No. 2 | 19 March 2019
- Surjective H-Colouring over Reflexive DigraphsACM Transactions on Computation Theory, Vol. 11, No. 1 | 21 November 2018
- The Complexity of Boolean Surjective General-Valued CSPsACM Transactions on Computation Theory, Vol. 11, No. 1 | 21 November 2018
- Binary constraint satisfaction problems defined by excluded topological minorsInformation and Computation, Vol. 264 | 1 Feb 2019
- Proof Complexity Meets AlgebraACM Transactions on Computational Logic, Vol. 20, No. 1 | 20 December 2018
- Constraint Satisfaction Problems for Reducts of Homogeneous GraphsSIAM Journal on Computing, Vol. 48, No. 4 | 18 July 2019
- Robust Algorithms with Polynomial Loss for Near-Unanimity CSPsSIAM Journal on Computing, Vol. 48, No. 6 | 26 November 2019
- Complexity of Conjunctive Regular Path Query HomomorphismsComputing with Foresight and Industry | 19 June 2019
- Algebraic Theory of Promise Constraint Satisfaction Problems, First StepsFundamentals of Computation Theory | 10 July 2019
- Uniform CSP Parameterized by Solution Size is in W[1]Computer Science – Theory and Applications | 16 May 2019
- Surjective H-colouring: New hardness resultsComputability, Vol. 8, No. 1 | 19 Dec 2018
- Constraint satisfaction problemsACM SIGLOG News, Vol. 5, No. 4 | 12 November 2018
- Towards a characterization of constant-factor approximable finite-valued CSPsJournal of Computer and System Sciences, Vol. 97 | 1 Nov 2018
- A complexity dichotomy for signed H -colouringDiscrete Mathematics, Vol. 341, No. 10 | 1 Oct 2018
- The Complexity of General-Valued CSPs Seen from the Other Side2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) | 1 Oct 2018
- The Limits of SDP Relaxations for General-Valued CSPsACM Transactions on Computation Theory, Vol. 10, No. 3 | 23 May 2018
- Computational Complexity Relationship between Compaction, Vertex-Compaction, and RetractionJournal of Discrete Algorithms, Vol. 52-53 | 1 Sep 2018
- Can One Escape Red Chains?Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 9 July 2018
- A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNPProceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 9 July 2018
- Satisfiability in multi-valued circuitsProceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 9 July 2018
- Extensor-codingProceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 20 June 2018
- Axiomatisability and hardness for universal Horn classes of hypergraphsAlgebra universalis, Vol. 79, No. 2 | 20 April 2018
- How Can Reasoners Simplify Database Querying (And Why Haven't They Done It Yet)?Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems | 27 May 2018
- Reconfiguration in bounded bandwidth and tree-depthJournal of Computer and System Sciences, Vol. 93 | 1 May 2018
- Discrete Temporal Constraint Satisfaction ProblemsJournal of the ACM, Vol. 65, No. 2 | 6 February 2018
- Some Complete and Intermediate Polynomials in Algebraic Complexity TheoryTheory of Computing Systems, Vol. 62, No. 3 | 13 March 2017
- Tropically Convex Constraint SatisfactionTheory of Computing Systems, Vol. 62, No. 3 | 17 April 2017
- On the complexity of H -coloring for special oriented treesEuropean Journal of Combinatorics, Vol. 69 | 1 Mar 2018
- Tractability conditions for numeric CSPsTheoretical Computer Science, Vol. 715 | 1 Mar 2018
- On the speed of constraint propagation and the time complexity of arc consistency testingJournal of Computer and System Sciences, Vol. 91 | 1 Feb 2018
- On the Complexity of the Model Checking ProblemSIAM Journal on Computing, Vol. 47, No. 3 | 12 June 2018
- Quasi-Transitive Digraphs and Their ExtensionsClasses of Directed Graphs | 19 June 2018
- Constraint Satisfaction Problems: Complexity and AlgorithmsLanguage and Automata Theory and Applications | 8 March 2018
- Quantified Valued Constraint Satisfaction ProblemPrinciples and Practice of Constraint Programming | 23 August 2018
- Computational Complexity Relationship between Compaction, Vertex-Compaction, and RetractionCombinatorial Algorithms | 17 April 2018
- On tree-preserving constraintsAnnals of Mathematics and Artificial Intelligence, Vol. 81, No. 3-4 | 29 May 2017
- Circuit satisfiability and constraint satisfaction around Skolem ArithmeticTheoretical Computer Science, Vol. 703 | 1 Dec 2017
- Correspondence Homomorphisms to Reflexive GraphsElectronic Notes in Discrete Mathematics, Vol. 62 | 1 Nov 2017
- The complexity of tropical graph homomorphismsDiscrete Applied Mathematics, Vol. 229 | 1 Oct 2017
- A Dichotomy Theorem for Nonuniform CSPs2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) | 1 Oct 2017
- A Proof of CSP Dichotomy Conjecture2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) | 1 Oct 2017
- Asking the Metaquestions in Constraint TractabilityACM Transactions on Computation Theory, Vol. 9, No. 3 | 4 October 2017
- The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and CircuitsTheory of Computing Systems, Vol. 61, No. 2 | 28 October 2015
- Regular families of forests, antichains and duality pairs of relational structuresCombinatorica, Vol. 37, No. 4 | 10 May 2016
- On planar valued CSPsJournal of Computer and System Sciences, Vol. 87 | 1 Aug 2017
- Oriented, 2-edge-colored, and 2-vertex-colored homomorphismsInformation Processing Letters, Vol. 123 | 1 Jul 2017
- Tight Lower Bounds on Graph Embedding ProblemsJournal of the ACM, Vol. 64, No. 3 | 16 June 2017
- Complexity of Counting CSP with Complex WeightsJournal of the ACM, Vol. 64, No. 3 | 16 June 2017
- The limits of SDP relaxations for general-valued CSPs2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 1 Jun 2017
- The homomorphism problem for regular graph patterns2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 1 Jun 2017
- The complexity of minimal inference problem for conservative constraint languages2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 1 Jun 2017
- The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 1 Jun 2017
- The pebbling comonad in Finite Model Theory2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 1 Jun 2017
- Constraint satisfaction problems over semilattice block Mal'tsev algebras2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 1 Jun 2017
- Dichotomies in Ontology-Mediated Querying with the Guarded FragmentProceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems | 9 May 2017
- List H-Coloring a Graph by Removing Few VerticesAlgorithmica, Vol. 78, No. 1 | 27 April 2016
- Backdoors into heterogeneous classes of SAT and CSPJournal of Computer and System Sciences, Vol. 85 | 1 May 2017
- Gap theorems for robust satisfiability: Boolean CSPs and beyondTheoretical Computer Science, Vol. 676 | 1 May 2017
- An Algorithm for Constraint Satisfaction Problem2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL) | 1 May 2017
- Discovering Archipelagos of Tractability for Constraint Satisfaction and CountingACM Transactions on Algorithms, Vol. 13, No. 2 | 6 March 2017
- Key (critical) relations preserved by a weak near-unanimity functionAlgebra universalis, Vol. 77, No. 2 | 31 January 2017
- Rigid Binary Relations on a 4-Element DomainOrder, Vol. 34, No. 1 | 20 May 2016
- The complexity of list edge-partitions for simple graphsEuropean Journal of Combinatorics, Vol. 61 | 1 Mar 2017
- The complexity of counting quantifiers on equality languagesTheoretical Computer Science, Vol. 670 | 1 Mar 2017
- The complexity of signed graph and edge-coloured graph homomorphismsDiscrete Mathematics, Vol. 340, No. 2 | 1 Feb 2017
- Colourings, homomorphisms, and partitions of transitive digraphsEuropean Journal of Combinatorics, Vol. 60 | 1 Feb 2017
- Equivariant algorithms for constraint satisfaction problems over coset templatesInformation Processing Letters, Vol. 118 | 1 Feb 2017
- Quantified Constraint Satisfaction Problem on Semicomplete DigraphsACM Transactions on Computational Logic, Vol. 18, No. 1 | 31 Jan 2017
- The Power of Sherali--Adams Relaxations for General-Valued CSPsSIAM Journal on Computing, Vol. 46, No. 4 | 20 July 2017
- Binarisation for Valued Constraint Satisfaction ProblemsSIAM Journal on Discrete Mathematics, Vol. 31, No. 4 | 3 October 2017
- The Complexity of General-Valued CSPsSIAM Journal on Computing, Vol. 46, No. 3 | 29 June 2017
- Surjective H-Colouring: New Hardness ResultsUnveiling Dynamics and Complexity | 12 May 2017
- All or Nothing: Toward a Promise Problem Dichotomy for Constraint ProblemsPrinciples and Practice of Constraint Programming | 23 August 2017
- Kernelization of Constraint Satisfaction Problems: A Study Through Universal AlgebraPrinciples and Practice of Constraint Programming | 23 August 2017
- The power of propagation: when GAC is enoughConstraints, Vol. 22, No. 1 | 23 August 2016
- Testing list H-homomorphismscomputational complexity, Vol. 25, No. 4 | 6 November 2014
- On finite Taylor algebrasInternational Journal of Algebra and Computation, Vol. 26, No. 08 | 20 December 2016
- The complexity of counting edge colorings and a dichotomy for some higher domain Holant problemsResearch in the Mathematical Sciences, Vol. 3, No. 1 | 1 September 2016
- The Complexity of Finite-Valued CSPsJournal of the ACM, Vol. 63, No. 4 | 21 September 2016
- Complexity and polymorphisms for digraph constraint problems under some basic constructionsInternational Journal of Algebra and Computation, Vol. 26, No. 07 | 13 November 2016
- Constraint satisfaction and semilinear expansions of addition over the rationals and the realsJournal of Computer and System Sciences, Vol. 82, No. 5 | 1 Aug 2016
- On algebras with many symmetric operationsInternational Journal of Algebra and Computation, Vol. 26, No. 05 | 14 August 2016
- The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden PatternsProceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 5 July 2016
- Graphs of relational structuresProceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 5 July 2016
- Weak consistency notions for all the CSPs of bounded widthProceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 5 July 2016
- Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfactionProceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 5 July 2016
- The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction ProblemsProceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 5 July 2016
- Datalog rewritability of Disjunctive Datalog programs and non-Horn ontologiesArtificial Intelligence, Vol. 236 | 1 Jul 2016
- On constraint satisfaction problems below PJournal of Logic and Computation, Vol. 26, No. 3 | 13 February 2014
- The collapse of the bounded width hierarchyJournal of Logic and Computation, Vol. 26, No. 3 | 23 November 2014
- A Galois Connection for Weighted (Relational) Clones of Infinite SizeACM Transactions on Computation Theory, Vol. 8, No. 3 | 11 May 2016
- Minimal Weighted Clones with Boolean Support2016 IEEE 46th International Symposium on Multiple-Valued Logic (ISMVL) | 1 May 2016
- Tractability in constraint satisfaction problems: a surveyConstraints, Vol. 21, No. 2 | 21 July 2015
- Distance constraint satisfaction problemsInformation and Computation, Vol. 247 | 1 Apr 2016
- Model Checking Existential Logic on Partially Ordered SetsACM Transactions on Computational Logic, Vol. 17, No. 2 | 25 November 2015
- A Dichotomy for Real Weighted Holant Problemscomputational complexity, Vol. 25, No. 1 | 17 November 2015
- Conservative constraint satisfaction re-revisitedJournal of Computer and System Sciences, Vol. 82, No. 2 | 1 Mar 2016
- Parameterized Complexity and Kernelizability of Max Ones and Exact Ones ProblemsACM Transactions on Computation Theory, Vol. 8, No. 1 | 3 February 2016
- A new line of attack on the dichotomy conjectureEuropean Journal of Combinatorics, Vol. 52 | 1 Feb 2016
- Robustly Solvable Constraint Satisfaction ProblemsSIAM Journal on Computing, Vol. 45, No. 4 | 30 August 2016
- Decomposing Quantified Conjunctive (or Disjunctive) FormulasSIAM Journal on Computing, Vol. 45, No. 6 | 15 November 2016
- Nonnegative Weighted #CSP: An Effective Complexity DichotomySIAM Journal on Computing, Vol. 45, No. 6 | 20 December 2016
- Semantic Acyclicity on Graph DatabasesSIAM Journal on Computing, Vol. 45, No. 4 | 2 August 2016
- A Complete Dichotomy Rises from the Capture of Vanishing SignaturesSIAM Journal on Computing, Vol. 45, No. 5 | 1 September 2016
- Max-Closed Semilinear Constraint SatisfactionComputer Science – Theory and Applications | 31 May 2016
- Circuit Satisfiability and Constraint Satisfaction Around Skolem ArithmeticPursuit of the Universal | 14 June 2016
- The Complexity of Counting Quantifiers on Equality LanguagesPursuit of the Universal | 14 June 2016
- Minimum Cost Homomorphisms with Constrained CostsComputing and Combinatorics | 20 July 2016
- The PPSZ Algorithm for Constraint Satisfaction Problems on More Than Two ColorsPrinciples and Practice of Constraint Programming | 23 August 2016
- The Dichotomy for Conservative Constraint Satisfaction is Polynomially DecidablePrinciples and Practice of Constraint Programming | 23 August 2016
- Computational complexity of covering three-vertex multigraphsTheoretical Computer Science, Vol. 609 | 1 Jan 2016
- Join colourings of chordal graphsDiscrete Mathematics, Vol. 338, No. 12 | 1 Dec 2015
- Dichotomy for finite tournaments of mixed-typeDiscrete Mathematics, Vol. 338, No. 12 | 1 Dec 2015
- The Complexity of General-Valued CSPs2015 IEEE 56th Annual Symposium on Foundations of Computer Science | 1 Oct 2015
- THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRAThe Bulletin of Symbolic Logic, Vol. 21, No. 3 | 15 September 2015
- Twisted Automorphisms and Twisted Right GyrogroupsCommunications in Algebra, Vol. 43, No. 8 | 4 June 2015
- Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 1 Jul 2015
- Homomorphisms of Signed GraphsJournal of Graph Theory, Vol. 79, No. 3 | 11 August 2014
- Commutative idempotent groupoids and the constraint satisfaction problemAlgebra universalis, Vol. 73, No. 3-4 | 29 April 2015
- Dichotomies in the Complexity of Preferred RepairsProceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems | 20 May 2015
- The Fine Classification of Conjunctive Queries and Parameterized Logarithmic SpaceACM Transactions on Computation Theory, Vol. 7, No. 2 | 11 May 2015
- Constructing NP-intermediate problems by blowing holes with parameters of various propertiesTheoretical Computer Science, Vol. 581 | 1 May 2015
- Algebras and Algorithms2015 IEEE International Symposium on Multiple-Valued Logic | 1 May 2015
- Topological BirkhoffTransactions of the American Mathematical Society, Vol. 367, No. 4 | 8 August 2014
- Why Is It Hard to Obtain a Dichotomy for Consistent Query Answering?ACM Transactions on Computational Logic, Vol. 16, No. 1 | 1 Mar 2015
- The Power of Linear Programming for General-Valued CSPsSIAM Journal on Computing, Vol. 44, No. 1 | 5 February 2015
- Counting List Matrix Partitions of GraphsSIAM Journal on Computing, Vol. 44, No. 4 | 11 August 2015
- Constraint Satisfaction with Counting QuantifiersSIAM Journal on Discrete Mathematics, Vol. 29, No. 2 | 16 June 2015
- Necessary Conditions for Tractability of Valued CSPsSIAM Journal on Discrete Mathematics, Vol. 29, No. 4 | 3 December 2015
- Solver performance on tractable CSPs: empirical evaluationBridging Constraint Satisfaction and Boolean Satisfiability | 1 Jan 2015
- Effectiveness of Structural Restrictions for Hybrid CSPsAlgorithms and Computation | 27 November 2015
- Constraint Satisfaction Problems over the Integers with SuccessorAutomata, Languages, and Programming | 20 June 2015
- On Planar Boolean CSPAutomata, Languages, and Programming | 20 June 2015
- On Tree-Preserving ConstraintsPrinciples and Practice of Constraint Programming | 13 August 2015
- Algebraic Properties of Valued Constraint Satisfaction ProblemAutomata, Languages, and Programming | 20 June 2015
- A Galois Connection for Valued Constraint Languages of Infinite SizeAutomata, Languages, and Programming | 20 June 2015
- Sherali-Adams Relaxations for Valued CSPsAutomata, Languages, and Programming | 20 June 2015
- Is Polynomial Time Choiceless?Fields of Logic and Computation II | 5 September 2015
- Lower Bounds for the Graph Homomorphism ProblemAutomata, Languages, and Programming | 20 June 2015
- IntroductionComputational Complexity of Solving Equation Systems | 25 July 2015
- Ontology-Based Data AccessACM Transactions on Database Systems, Vol. 39, No. 4 | 30 December 2014
- Tractability of quantified temporal constraints to the maxInternational Journal of Algebra and Computation, Vol. 24, No. 08 | 7 January 2015
- Weak classification of finite groupsAsian-European Journal of Mathematics, Vol. 07, No. 04 | 16 December 2014
- Constraint Solving via Fractional Edge CoversACM Transactions on Algorithms, Vol. 11, No. 1 | 25 August 2014
- Constraint satisfaction problem and universal algebraACM SIGLOG News, Vol. 1, No. 2 | 14 October 2014
- Connected obstructions to full graph homomorphismsEuropean Journal of Combinatorics, Vol. 41 | 1 Oct 2014
- H-coloring degree-bounded (acyclic) digraphsTheoretical Computer Science, Vol. 554 | 1 Oct 2014
- The Complexity of Counting Edge Colorings and a Dichotomy for Some Higher Domain Holant Problems2014 IEEE 55th Annual Symposium on Foundations of Computer Science | 1 Oct 2014
- CSPs and Connectedness: P/NP Dichotomy for Idempotent, Right Quasigroups2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing | 1 Sep 2014
- Decidability of absorption in relational structures of bounded widthAlgebra universalis, Vol. 72, No. 1 | 4 May 2014
- Model checking existential logic on partially ordered setsProceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 14 July 2014
- Turing machines with atoms, constraint satisfaction problems, and descriptive complexityProceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 14 July 2014
- A Generalized Version of the Baker–Pixley TheoremCommunications in Algebra, Vol. 42, No. 6 | 1 February 2014
- Counting List Matrix Partitions of Graphs2014 IEEE 29th Conference on Computational Complexity (CCC) | 1 Jun 2014
- On Key Relations Preserved by a Weak Near-Unanimity Function2014 IEEE 44th International Symposium on Multiple-Valued Logic | 1 May 2014
- The Complexity of Approximately Counting Tree HomomorphismsACM Transactions on Computation Theory, Vol. 6, No. 2 | 1 May 2014
- A method for reduction of examples in relational learningJournal of Intelligent Information Systems, Vol. 42, No. 2 | 17 December 2013
- The existence of a near-unanimity function is decidableAlgebra universalis, Vol. 71, No. 1 | 23 October 2013
- Semilattice polymorphisms and chordal graphsEuropean Journal of Combinatorics, Vol. 36 | 1 Feb 2014
- Constraint Satisfaction Parameterized by Solution SizeSIAM Journal on Computing, Vol. 43, No. 2 | 15 April 2014
- Skew Bisubmodularity and Valued CSPsSIAM Journal on Computing, Vol. 43, No. 3 | 8 May 2014
- Constraint Satisfaction with Counting Quantifiers 2Computer Science - Theory and Applications | 1 Jan 2014
- The Propagation Depth of Local ConsistencyPrinciples and Practice of Constraint Programming | 1 Jan 2014
- On Backdoors to Tractable Constraint LanguagesPrinciples and Practice of Constraint Programming | 1 Jan 2014
- P ≠ PWeb Reasoning and Rule Systems | 1 Jan 2014
- The Complexity of Homomorphisms of Signed Graphs and Signed Constraint SatisfactionLATIN 2014: Theoretical Informatics | 1 Jan 2014
- On the Complexity of Trial and Error for Constraint Satisfaction ProblemsAutomata, Languages, and Programming | 1 Jan 2014
- QCSP on Semicomplete DigraphsAutomata, Languages, and Programming | 1 Jan 2014
- Obstructions to locally injective oriented improper colouringsEuropean Journal of Combinatorics, Vol. 35 | 1 Jan 2014
- Graph partitions with prescribed patternsEuropean Journal of Combinatorics, Vol. 35 | 1 Jan 2014
- Computational Complexity of Covering Three-Vertex MultigraphsMathematical Foundations of Computer Science 2014 | 1 Jan 2014
- Constraint Satisfaction Problems Solvable by Local Consistency MethodsJournal of the ACM, Vol. 61, No. 1 | 1 January 2014
- List-homomorphism problems on graphs and arc consistencyDiscrete Mathematics, Vol. 313, No. 22 | 1 Nov 2013
- Constraint satisfaction tractability from semi-lattice operations on infinite setsACM Transactions on Computational Logic, Vol. 14, No. 4 | 28 November 2013
- Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive QueriesJournal of the ACM, Vol. 60, No. 6 | 1 November 2013
- Robust Satisfiability for CSPsACM Transactions on Computation Theory, Vol. 5, No. 4 | 1 November 2013
- Obstructions to partitions of chordal graphsDiscrete Mathematics, Vol. 313, No. 19 | 1 Oct 2013
- The complexity of the counting constraint satisfaction problemJournal of the ACM, Vol. 60, No. 5 | 28 October 2013
- COMPUTATIONAL COMPLEXITY OF VARIOUS MAL'CEV CONDITIONSInternational Journal of Algebra and Computation, Vol. 23, No. 06 | 19 September 2013
- CSP DICHOTOMY FOR SPECIAL POLYADSInternational Journal of Algebra and Computation, Vol. 23, No. 05 | 21 August 2013
- On finitely related semigroupsSemigroup Forum, Vol. 86, No. 3 | 4 December 2012
- The complexity of conservative valued CSPsJournal of the ACM, Vol. 60, No. 2 | 3 May 2013
- Constraint Satisfaction, Irredundant Axiomatisability and Continuous ColouringStudia Logica, Vol. 101, No. 1 | 12 June 2012
- Computational complexity of linear constraints over the integersArtificial Intelligence, Vol. 195 | 1 Feb 2013
- Datalog and constraint satisfaction with infinite templatesJournal of Computer and System Sciences, Vol. 79, No. 1 | 1 Feb 2013
- Constraint satisfaction problems: Convexity makes AllDifferent constraints tractableTheoretical Computer Science, Vol. 472 | 1 Feb 2013
- An Effective Dichotomy for the Counting Constraint Satisfaction ProblemSIAM Journal on Computing, Vol. 42, No. 3 | 25 June 2013
- The Complexity of Symmetric Boolean Parity Holant ProblemsSIAM Journal on Computing, Vol. 42, No. 1 | 14 February 2013
- Graph Homomorphisms with Complex Values: A Dichotomy TheoremSIAM Journal on Computing, Vol. 42, No. 3 | 21 May 2013
- Caterpillar Dualities and Regular LanguagesSIAM Journal on Discrete Mathematics, Vol. 27, No. 3 | 18 July 2013
- Graphs Admitting $k$-NU Operations. Part 1: The Reflexive CaseSIAM Journal on Discrete Mathematics, Vol. 27, No. 4 | 7 November 2013
- An Algebraic Theory of Complexity for Discrete OptimizationSIAM Journal on Computing, Vol. 42, No. 5 | 1 October 2013
- Reducing Examples in Relational Learning with Bounded-Treewidth HypothesesNew Frontiers in Mining Complex Patterns | 1 Jan 2013
- QCSP on Partially Reflexive Cycles – The Wavy Line of TractabilityComputer Science – Theory and Applications | 1 Jan 2013
- Small H-Coloring Problems for Bounded Degree DigraphsComputing and Combinatorics | 1 Jan 2013
- The Power of Linear Programming for Finite-Valued CSPs: A Constructive CharacterizationAutomata, Languages, and Programming | 1 Jan 2013
- A Combinatorial Classic — Sparse Graphs with High Chromatic NumberErdős Centennial | 1 Jan 2013
- On the Speed of Constraint Propagation and the Time Complexity of Arc Consistency TestingMathematical Foundations of Computer Science 2013 | 1 Jan 2013
- List H-Coloring a Graph by Removing Few VerticesAlgorithms – ESA 2013 | 1 Jan 2013
- On the Reduction of the CSP Dichotomy Conjecture to DigraphsPrinciples and Practice of Constraint Programming | 1 Jan 2013
- Fifty years of the spectrum problem: survey and new resultsThe Bulletin of Symbolic Logic, Vol. 18, No. 4 | 5 September 2014
- Query processing under GLAV mappings for relational and graph databasesProceedings of the VLDB Endowment, Vol. 6, No. 2 | 1 December 2012
- From Holant to #CSP and Back: Dichotomy for Holant c ProblemsAlgorithmica, Vol. 64, No. 3 | 1 March 2012
- The complexity of approximating bounded-degree Boolean #CSPInformation and Computation, Vol. 220-221 | 1 Nov 2012
- Computing vertex-surjective homomorphisms to partially reflexive treesTheoretical Computer Science, Vol. 457 | 1 Oct 2012
- The Power of Linear Programming for Valued CSPs2012 IEEE 53rd Annual Symposium on Foundations of Computer Science | 1 Oct 2012
- The Complexity of the List Homomorphism Problem for GraphsTheory of Computing Systems, Vol. 51, No. 2 | 19 May 2011
- The complexity of surjective homomorphism problems—a surveyDiscrete Applied Mathematics, Vol. 160, No. 12 | 1 Aug 2012
- Reflexive digraphs with near unanimity polymorphismsDiscrete Mathematics, Vol. 312, No. 15 | 1 Aug 2012
- A Dichotomy for Real Weighted Holant Problems2012 IEEE 27th Conference on Computational Complexity | 1 Jun 2012
- Testing List H-homomorphisms2012 IEEE 27th Conference on Computational Complexity | 1 Jun 2012
- Lower Bounds for Existential Pebble Games and k-Consistency Tests2012 27th Annual IEEE Symposium on Logic in Computer Science | 1 Jun 2012
- Near Unanimity Constraints Have Bounded Pathwidth Duality2012 27th Annual IEEE Symposium on Logic in Computer Science | 1 Jun 2012
- An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction2012 27th Annual IEEE Symposium on Logic in Computer Science | 1 Jun 2012
- List-Homomorphism Problems on Graphs and Arc Consistency2012 IEEE 42nd International Symposium on Multiple-Valued Logic | 1 May 2012
- Computing hypergraph width measures exactlyInformation Processing Letters, Vol. 112, No. 6 | 1 Mar 2012
- Enumerating homomorphismsJournal of Computer and System Sciences, Vol. 78, No. 2 | 1 Mar 2012
- On the Complexity of MMSNPSIAM Journal on Discrete Mathematics, Vol. 26, No. 1 | 29 March 2012
- The Dichotomy of Minimum Cost Homomorphism Problems for DigraphsSIAM Journal on Discrete Mathematics, Vol. 26, No. 4 | 25 October 2012
- Meditations on Quantified Constraint SatisfactionLogic and Program Semantics | 1 Jan 2012
- Constraint Optimization Problems and Bounded Tree-Width RevisitedIntegration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems | 1 Jan 2012
- Constraint Satisfaction with Counting QuantifiersComputer Science – Theory and Applications | 1 Jan 2012
- Counting Homomorphisms via Hypergraph-Based Structural RestrictionsCombinatorial Optimization | 1 Jan 2012
- A Dichotomy Theorem for Homomorphism PolynomialsMathematical Foundations of Computer Science 2012 | 1 Jan 2012
- Containment, Equivalence and Coreness from CSP to QCSP and BeyondPrinciples and Practice of Constraint Programming | 1 Jan 2012
- Syntactically Characterizing Local-to-Global Consistency in ORD-HornPrinciples and Practice of Constraint Programming | 1 Jan 2012
- Counting Partitions of GraphsAlgorithms and Computation | 1 Jan 2012
- Tree-width for first order formulaeLogical Methods in Computer Science, Vol. 8, No. 1 | 29 March 2012
- The Complexity of Positive First-Order Logic without EqualityACM Transactions on Computational Logic, Vol. 13, No. 1 | 1 January 2012
- BackgroundThe Complexity of Valued Constraint Satisfaction Problems | 1 Jan 2012
- Guest columnACM SIGACT News, Vol. 42, No. 4 | 13 December 2011
- Partitioning Chordal GraphsElectronic Notes in Discrete Mathematics, Vol. 38 | 1 Dec 2011
- Obstructions to Injective Oriented ColouringsElectronic Notes in Discrete Mathematics, Vol. 38 | 1 Dec 2011
- Two new homomorphism dualities and lattice operationsJournal of Logic and Computation, Vol. 21, No. 6 | 22 August 2010
- Interleaved adjoints of directed graphsEuropean Journal of Combinatorics, Vol. 32, No. 7 | 1 Oct 2011
- Dichotomy for tree-structured trigraph list homomorphism problemsDiscrete Applied Mathematics, Vol. 159, No. 12 | 1 Jul 2011
- The Ck -extended graft constructionDiscrete Applied Mathematics, Vol. 159, No. 12 | 1 Jul 2011
- Disjunction property and complexity of substructural logicsTheoretical Computer Science, Vol. 412, No. 31 | 1 Jul 2011
- Complexity of conservative constraint satisfaction problemsACM Transactions on Computational Logic, Vol. 12, No. 4 | 22 July 2011
- Hybrid tractability of valued constraint problemsArtificial Intelligence, Vol. 175, No. 9-10 | 1 Jun 2011
- Non-negatively Weighted #CSP: An Effective Complexity Dichotomy2011 IEEE 26th Annual Conference on Computational Complexity | 1 Jun 2011
- The Dichotomy for Conservative Constraint Satisfaction Problems Revisited2011 IEEE 26th Annual Symposium on Logic in Computer Science | 1 Jun 2011
- On solvability of systems of polynomial equationsAlgebra universalis, Vol. 65, No. 3 | 12 April 2011
- Tractable Structures for Constraint Satisfaction with Truth TablesTheory of Computing Systems, Vol. 48, No. 3 | 2 December 2009
- Maltsev digraphs have a majority polymorphismEuropean Journal of Combinatorics, Vol. 32, No. 3 | 1 Apr 2011
- Limit Behavior of Locally Consistent Constraint Satisfaction ProblemsSIAM Journal on Discrete Mathematics, Vol. 25, No. 2 | 1 July 2011
- Computing Vertex-Surjective Homomorphisms to Partially Reflexive TreesComputer Science – Theory and Applications | 1 Jan 2011
- On the CSP Dichotomy ConjectureComputer Science – Theory and Applications | 1 Jan 2011
- The Complexity of Symmetric Boolean Parity Holant ProblemsAutomata, Languages and Programming | 1 Jan 2011
- An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois ConnectionMathematical Foundations of Computer Science 2011 | 1 Jan 2011
- Submodularity on a Tree: Unifying $L^\natural$ -Convex and Bisubmodular FunctionsMathematical Foundations of Computer Science 2011 | 1 Jan 2011
- On Guaranteeing Polynomially Bounded Search Tree SizePrinciples and Practice of Constraint Programming – CP 2011 | 1 Jan 2011
- Tractable TrianglesPrinciples and Practice of Constraint Programming – CP 2011 | 1 Jan 2011
- On Minimal Weighted ClonesPrinciples and Practice of Constraint Programming – CP 2011 | 1 Jan 2011
- QCSP on Partially Reflexive ForestsPrinciples and Practice of Constraint Programming – CP 2011 | 1 Jan 2011
- Generalizing Parikh’s TheoremGames, Norms and Reasons | 7 March 2011
- Constraint satisfaction with succinctly specified relationsJournal of Computer and System Sciences, Vol. 76, No. 8 | 1 Dec 2010
- RESIDUAL PROPERTIES OF SIMPLE GRAPHSBulletin of the Australian Mathematical Society, Vol. 82, No. 3 | 18 August 2010
- TERM EQUATION SATISFIABILITY OVER FINITE ALGEBRASInternational Journal of Algebra and Computation, Vol. 20, No. 08 | 30 April 2012
- Dualities and Dual Pairs in Heyting AlgebrasOrder, Vol. 27, No. 3 | 16 July 2010
- A strong Mal’cev condition for locally finite varieties omitting the unary typeAlgebra universalis, Vol. 64, No. 1-2 | 10 October 2010
- A Decidable Dichotomy Theorem on Directed Graph Homomorphisms with Non-negative Weights2010 IEEE 51st Annual Symposium on Foundations of Computer Science | 1 Oct 2010
- Constraint satisfaction problems and global cardinality constraintsCommunications of the ACM, Vol. 53, No. 9 | 1 September 2010
- On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction2010 25th Annual IEEE Symposium on Logic in Computer Science | 1 Jul 2010
- New Conditions for Taylor Varieties and CSP2010 25th Annual IEEE Symposium on Logic in Computer Science | 1 Jul 2010
- CSP duality and trees of bounded pathwidthTheoretical Computer Science, Vol. 411, No. 34-36 | 1 Jul 2010
- Generalizing constraint satisfaction on trees: Hybrid tractability and variable eliminationArtificial Intelligence, Vol. 174, No. 9-10 | 1 Jun 2010
- Absolute retracts and varieties generated by chordal graphsDiscrete Mathematics, Vol. 310, No. 10-11 | 1 Jun 2010
- An approximation trichotomy for Boolean #CSPJournal of Computer and System Sciences, Vol. 76, No. 3-4 | 1 May 2010
- A fast algorithm and datalog inexpressibility for temporal reasoningACM Transactions on Computational Logic, Vol. 11, No. 3 | 18 May 2010
- 2K2 vertex-set partition into nonempty partsDiscrete Mathematics, Vol. 310, No. 6-7 | 1 Apr 2010
- Varieties with few subalgebras of powersTransactions of the American Mathematical Society, Vol. 362, No. 3 | 19 October 2009
- Approximating fractional hypertree widthACM Transactions on Algorithms, Vol. 6, No. 2 | 6 April 2010
- The Helly property and satisfiability of Boolean formulas defined on set familiesEuropean Journal of Combinatorics, Vol. 31, No. 2 | 1 Feb 2010
- Retractions to PseudoforestsSIAM Journal on Discrete Mathematics, Vol. 24, No. 1 | 19 February 2010
- Congruence Distributivity Implies Bounded WidthSIAM Journal on Computing, Vol. 39, No. 4 | 2 December 2009
- Tractability and Learnability Arising from Algebras with Few SubpowersSIAM Journal on Computing, Vol. 39, No. 7 | 9 June 2010
- Injective Oriented ColouringsGraph-Theoretic Concepts in Computer Science | 1 Jan 2010
- Extensions of the Minimum Cost Homomorphism ProblemComputing and Combinatorics | 1 Jan 2010
- Graph Homomorphisms with Complex Values: A Dichotomy TheoremAutomata, Languages and Programming | 1 Jan 2010
- Finding Reductions AutomaticallyFields of Logic and Computation | 1 Jan 2010
- Distance Constraint Satisfaction ProblemsMathematical Foundations of Computer Science 2010 | 1 Jan 2010
- Parameterized Complexity and Kernelizability of Max Ones and Exact Ones ProblemsMathematical Foundations of Computer Science 2010 | 1 Jan 2010
- Tree Dualities for Constraint SatisfactionComputer Science Logic | 1 Jan 2010
- A New Hybrid Tractable Class of Soft Constraint ProblemsPrinciples and Practice of Constraint Programming – CP 2010 | 1 Jan 2010
- On the Containment of Forbidden Patterns ProblemsPrinciples and Practice of Constraint Programming – CP 2010 | 1 Jan 2010
- From Holant to #CSP and Back: Dichotomy for Holant c ProblemsAlgorithms and Computation | 1 Jan 2010
- A combinatorial constraint satisfaction problem dichotomy classification conjectureEuropean Journal of Combinatorics, Vol. 31, No. 1 | 1 Jan 2010
- Peek arc consistencyTheoretical Computer Science, Vol. 411, No. 2 | 1 Jan 2010
- The complexity of global cardinality constraintsLogical Methods in Computer Science, Vol. 6, No. 4 | 27 October 2010
- The complexity of temporal constraint satisfaction problemsJournal of the ACM, Vol. 57, No. 2 | 8 February 2010
- Congruence modularity implies cyclic terms for finite algebrasAlgebra universalis, Vol. 61, No. 3-4 | 30 October 2009
- A rendezvous of logic, complexity, and algebraACM Computing Surveys, Vol. 42, No. 1 | 14 December 2009
- Constraint Satisfaction Problems of Bounded Width2009 50th Annual IEEE Symposium on Foundations of Computer Science | 1 Oct 2009
- Edge-switching homomorphisms of edge-coloured graphsDiscrete Mathematics, Vol. 309, No. 18 | 1 Sep 2009
- A surprising permanence of old motivations (a not-so-rigid story)Discrete Mathematics, Vol. 309, No. 18 | 1 Sep 2009
- Hard constraint satisfaction problems have hard gaps at location 1Theoretical Computer Science, Vol. 410, No. 38-40 | 1 Sep 2009
- The complexity of weighted Boolean #CSP with mixed signsTheoretical Computer Science, Vol. 410, No. 38-40 | 1 Sep 2009
- The existence of a near-unanimity term in a finite algebra is decidableThe Journal of Symbolic Logic, Vol. 74, No. 3 | 12 March 2014
- The complexity of constraint satisfaction games and QCSPInformation and Computation, Vol. 207, No. 9 | 1 Sep 2009
- The Complexity of Positive First-order Logic without Equality2009 24th Annual IEEE Symposium on Logic In Computer Science | 1 Aug 2009
- The Complexity of Global Cardinality Constraints2009 24th Annual IEEE Symposium on Logic In Computer Science | 1 Aug 2009
- OMITTING TYPES, BOUNDED WIDTH AND THE ABILITY TO COUNTInternational Journal of Algebra and Computation, Vol. 19, No. 05 | 20 November 2011
- The complexity of satisfiability problems: Refining Schaefer's theoremJournal of Computer and System Sciences, Vol. 75, No. 4 | 1 Jun 2009
- Extension problems with degree boundsDiscrete Applied Mathematics, Vol. 157, No. 7 | 1 Apr 2009
- The SAT–UNSAT transition for random constraint satisfaction problemsDiscrete Mathematics, Vol. 309, No. 8 | 1 Apr 2009
- Universal algebra and hardness results for constraint satisfaction problemsTheoretical Computer Science, Vol. 410, No. 18 | 1 Apr 2009
- Affine systems of equations and counting infinitary logicTheoretical Computer Science, Vol. 410, No. 18 | 1 Apr 2009
- Maximal infinite-valued constraint languagesTheoretical Computer Science, Vol. 410, No. 18 | 1 Apr 2009
- Relatively quantified constraint satisfactionConstraints, Vol. 14, No. 1 | 6 July 2008
- Adjusted Interval DigraphsElectronic Notes in Discrete Mathematics, Vol. 32 | 1 Mar 2009
- Existentially restricted quantified constraint satisfactionInformation and Computation, Vol. 207, No. 3 | 1 Mar 2009
- The Complexity of Weighted Boolean #CSPSIAM Journal on Computing, Vol. 38, No. 5 | 14 January 2009
- The Connectivity of Boolean Satisfiability: Computational and Structural DichotomiesSIAM Journal on Computing, Vol. 38, No. 6 | 4 March 2009
- The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)SIAM Journal on Computing, Vol. 38, No. 5 | 9 January 2009
- On the Computational Complexity of Monotone Constraint Satisfaction ProblemsWALCOM: Algorithms and Computation | 1 Jan 2009
- Presenting ConstraintsAutomated Reasoning with Analytic Tableaux and Related Methods | 1 Jan 2009
- Decidable Relationships between Consistency Notions for Constraint Satisfaction ProblemsComputer Science Logic | 1 Jan 2009
- Tree-Width for First Order FormulaeComputer Science Logic | 1 Jan 2009
- Same-Relation ConstraintsPrinciples and Practice of Constraint Programming - CP 2009 | 1 Jan 2009
- There are no pure relational width 2 constraint satisfaction problemsInformation Processing Letters, Vol. 109, No. 4 | 1 Jan 2009
- Universal Structures and the logic of Forbidden PatternsLogical Methods in Computer Science, Vol. 5, No. 2 | 2 June 2009
- Minimization of Locally Defined Submodular Functions by Optimal Soft Arc ConsistencyConstraints, Vol. 13, No. 4 | 21 February 2008
- Congruences on the subclones of the rank 3 Burle clone containing no creative functionsSiberian Mathematical Journal, Vol. 49, No. 5 | 9 October 2008
- The approximability of MAX CSP with fixed-value constraintsJournal of the ACM, Vol. 55, No. 4 | 18 September 2008
- Locally constrained graph homomorphisms—structure, complexity, and applicationsComputer Science Review, Vol. 2, No. 2 | 1 Aug 2008
- Computational complexity of auditing finite attributes in statistical databasesJournal of Computer and System Sciences, Vol. 74, No. 5 | 1 Aug 2008
- Partially Ordered Connectives and Monadic Monotone Strict NPJournal of Logic, Language and Information, Vol. 17, No. 3 | 27 February 2008
- On the restricted homomorphism problemDiscrete Applied Mathematics, Vol. 156, No. 14 | 1 Jul 2008
- Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphismsTheoretical Computer Science, Vol. 401, No. 1-3 | 1 Jul 2008
- What makes propositional abduction tractableArtificial Intelligence, Vol. 172, No. 10 | 1 Jun 2008
- Retractions onto series-parallel posetsDiscrete Mathematics, Vol. 308, No. 11 | 1 Jun 2008
- Maltsev + Datalog --≫ Symmetric Datalog2008 23rd Annual IEEE Symposium on Logic in Computer Science | 1 Jun 2008
- Quantified Constraints and Containment Problems2008 23rd Annual IEEE Symposium on Logic in Computer Science | 1 Jun 2008
- Caterpillar Duality for Constraint Satisfaction Problems2008 23rd Annual IEEE Symposium on Logic in Computer Science | 1 Jun 2008
- The complexity of temporal constraint satisfaction problemsProceedings of the fortieth annual ACM symposium on Theory of computing | 17 May 2008
- Graphs, polymorphisms and the complexity of homomorphism problemsProceedings of the fortieth annual ACM symposium on Theory of computing | 17 May 2008
- On digraph coloring problems and treewidth dualityEuropean Journal of Combinatorics, Vol. 29, No. 4 | 1 May 2008
- Majority functions on structures with finite dualityEuropean Journal of Combinatorics, Vol. 29, No. 4 | 1 May 2008
- Generalised dualities and maximal finite antichains in the homomorphism order of relational structuresEuropean Journal of Combinatorics, Vol. 29, No. 4 | 1 May 2008
- Majority constraints have bounded pathwidth dualityEuropean Journal of Combinatorics, Vol. 29, No. 4 | 1 May 2008
- Forbidden lifts (NP and CSP for combinatorialists)European Journal of Combinatorics, Vol. 29, No. 4 | 1 May 2008
- A combinatorial characterization of resolution widthJournal of Computer and System Sciences, Vol. 74, No. 3 | 1 May 2008
- Complexity of Clausal Constraints Over ChainsTheory of Computing Systems, Vol. 42, No. 2 | 28 September 2007
- Counting truth assignments of formulas of bounded tree-width or clique-widthDiscrete Applied Mathematics, Vol. 156, No. 4 | 1 Feb 2008
- Efficient Algorithms for Description Problems over Finite Totally Ordered DomainsSIAM Journal on Computing, Vol. 38, No. 3 | 6 June 2008
- Brooks-Type Theorems for Pair-List Colorings and List HomomorphismsSIAM Journal on Discrete Mathematics, Vol. 22, No. 1 | 6 February 2008
- The Complexity of the List Partition Problem for GraphsSIAM Journal on Discrete Mathematics, Vol. 21, No. 4 | 7 December 2007
- The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element CaseSIAM Journal on Computing, Vol. 37, No. 5 | 14 February 2008
- MAX ONES Generalized to Larger DomainsSIAM Journal on Computing, Vol. 38, No. 1 | 18 April 2008
- Near-Unanimity Functions and Varieties of Reflexive GraphsSIAM Journal on Discrete Mathematics, Vol. 22, No. 3 | 21 May 2008
- Introduction to the Maximum Solution ProblemComplexity of Constraints | 1 Jan 2008
- Recent Results on the Algebraic Approach to the CSPComplexity of Constraints | 1 Jan 2008
- Dualities for Constraint Satisfaction ProblemsComplexity of Constraints | 1 Jan 2008
- A Logical Approach to Constraint SatisfactionComplexity of Constraints | 1 Jan 2008
- Uniform Constraint Satisfaction Problems and Database TheoryComplexity of Constraints | 1 Jan 2008
- Constraint Satisfaction Problems with Infinite TemplatesComplexity of Constraints | 1 Jan 2008
- The Complexity of the Counting Constraint Satisfaction ProblemAutomata, Languages and Programming | 1 Jan 2008
- On counting homomorphisms to directed acyclic graphsJournal of the ACM, Vol. 54, No. 6 | 1 December 2007
- Can you beat treewidth?48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) | 1 Oct 2007
- NP for CombinatorialistsElectronic Notes in Discrete Mathematics, Vol. 29 | 1 Aug 2007
- Maximum H-colourable subdigraphs and constraint optimization with arbitrary weightsJournal of Computer and System Sciences, Vol. 73, No. 5 | 1 Aug 2007
- SOLVABILITY OF SYSTEMS OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRASInternational Journal of Algebra and Computation, Vol. 17, No. 04 | 20 November 2011
- Towards a dichotomy theorem for the counting constraint satisfaction problemInformation and Computation, Vol. 205, No. 5 | 1 May 2007
- Matrix Partitions with Finitely Many ObstructionsElectronic Notes in Discrete Mathematics, Vol. 28 | 1 Mar 2007
- View-based query processing: On the relationship between rewriting, answering and losslessnessTheoretical Computer Science, Vol. 371, No. 3 | 1 Mar 2007
- The complexity of homomorphism and constraint satisfaction problems seen from the other sideJournal of the ACM, Vol. 54, No. 1 | 1 March 2007
- Determining the consistency of partial tree descriptionsArtificial Intelligence, Vol. 171, No. 2-3 | 1 Feb 2007
- List homomorphisms of graphs with bounded degreesDiscrete Mathematics, Vol. 307, No. 3-5 | 1 Feb 2007
- The structure of bi-arc treesDiscrete Mathematics, Vol. 307, No. 3-5 | 1 Feb 2007
- Constraint Satisfaction, Logic and Forbidden PatternsSIAM Journal on Computing, Vol. 37, No. 1 | 10 April 2007
- Hierarchies in Fragments of Monadic Strict NPComputation and Logic in the Real World | 1 Jan 2007
- Computational Complexity of Constraint SatisfactionComputation and Logic in the Real World | 1 Jan 2007
- Maximal Infinite-Valued Constraint LanguagesAutomata, Languages and Programming | 1 Jan 2007
- Symmetric Datalog and Constraint Satisfaction Problems in Logspace22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007) | 1 Jan 2007
- Tractability and learnability arising from algebras with few subpowers22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007) | 1 Jan 2007
- A rendezvous of logic, complexity, and algebraACM SIGACT News, Vol. 37, No. 4 | 1 December 2006
- The property of being polynomial for Mal’tsev constraint satisfaction problemsAlgebra and Logic, Vol. 45, No. 6 | 1 Nov 2006
- Digraph matrix partitions and trigraph homomorphismsDiscrete Applied Mathematics, Vol. 154, No. 17 | 1 Nov 2006
- Matrix partitions of perfect graphsDiscrete Mathematics, Vol. 306, No. 19-20 | 1 Oct 2006
- The complexity of soft constraint satisfactionArtificial Intelligence, Vol. 170, No. 11 | 1 Aug 2006
- Building blocks for the variety of absolute retractsDiscrete Mathematics, Vol. 306, No. 15 | 1 Aug 2006
- TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRASInternational Journal of Algebra and Computation, Vol. 16, No. 03 | 20 November 2011
- Minimum cost and list homomorphisms to semicomplete digraphsDiscrete Applied Mathematics, Vol. 154, No. 6 | 1 Apr 2006
- Combinatorial problems raised from 2-semilatticesJournal of Algebra, Vol. 298, No. 2 | 1 Apr 2006
- On Twisted Subgroups and Bol Loops of Odd OrderRocky Mountain Journal of Mathematics, Vol. 36, No. 1 | 1 Feb 2006
- A Simple Algorithm for Mal'tsev ConstraintsSIAM Journal on Computing, Vol. 36, No. 1 | 27 July 2006
- Full Constraint Satisfaction ProblemsSIAM Journal on Computing, Vol. 36, No. 1 | 27 July 2006
- A Probabilistic Approach to the Dichotomy ProblemSIAM Journal on Computing, Vol. 36, No. 3 | 14 November 2006
- The Approximability of Three-valued MAX CSPSIAM Journal on Computing, Vol. 35, No. 6 | 27 July 2006
- A Dichotomy Theorem on Fixed Points of Several Nonexpansive MappingsSIAM Journal on Discrete Mathematics, Vol. 20, No. 2 | 1 August 2006
- Datalog and Constraint Satisfaction with Infinite TemplatesSTACS 2006 | 1 Jan 2006
- Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction ProblemsComputer Science – Theory and Applications | 1 Jan 2006
- Towards a Trichotomy for Quantified H-ColoringLogical Approaches to Computational Barriers | 1 Jan 2006
- On Counting Homomorphisms to Directed Acyclic GraphsAutomata, Languages and Programming | 1 Jan 2006
- A Dichotomy Theorem for Typed Constraint Satisfaction ProblemsTheory and Applications of Satisfiability Testing - SAT 2006 | 1 Jan 2006
- The Structure of Tractable Constraint Satisfaction ProblemsMathematical Foundations of Computer Science 2006 | 1 Jan 2006
- Systems of Equations over Finite Semigroups and the #CSP Dichotomy ConjectureMathematical Foundations of Computer Science 2006 | 1 Jan 2006
- Collapsibility in Infinite-Domain Quantified Constraint SatisfactionComputer Science Logic | 1 Jan 2006
- Universal Structures and the Logic of Forbidden PatternsComputer Science Logic | 1 Jan 2006
- An Algebraic Characterisation of Complexity for Valued ConstraintPrinciples and Practice of Constraint Programming - CP 2006 | 1 Jan 2006
- Approximability of Integer Programming with Generalised ConstraintsPrinciples and Practice of Constraint Programming - CP 2006 | 1 Jan 2006
- Locally Injective Graph Homomorphism: Lists Guarantee DichotomyGraph-Theoretic Concepts in Computer Science | 1 Jan 2006
- Generalised Dualities and Finite Maximal AntichainsGraph-Theoretic Concepts in Computer Science | 1 Jan 2006
- The Complexity of Constraint LanguagesHandbook of Constraint Programming | 1 Jan 2006
- A dichotomy theorem for constraint satisfaction problems on a 3-element setJournal of the ACM, Vol. 53, No. 1 | 1 January 2006
- The complexity of partition functionsTheoretical Computer Science, Vol. 348, No. 2-3 | 1 Dec 2005
- H-Coloring dichotomy revisitedTheoretical Computer Science, Vol. 349, No. 1 | 1 Dec 2005
- A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general resultsJournal of Computer and System Sciences, Vol. 71, No. 4 | 1 Nov 2005
- The recognition of bound quivers using edge-coloured homomorphismsDiscrete Mathematics, Vol. 297, No. 1-3 | 1 Jul 2005
- A new tractable class of constraint satisfaction problemsAnnals of Mathematics and Artificial Intelligence, Vol. 44, No. 1-2 | 1 May 2005
- A polynomial-time algorithm for near-unanimity graphsJournal of Algorithms, Vol. 55, No. 2 | 1 May 2005
- Periodic Constraint Satisfaction Problems: Tractable SubclassesConstraints, Vol. 10, No. 2 | 21 April 2005
- THE PERKINS SEMIGROUP HAS CO-NP-COMPLETE TERM-EQUIVALENCE PROBLEMInternational Journal of Algebra and Computation, Vol. 15, No. 02 | 20 November 2011
- Classifying the Complexity of Constraints Using Finite AlgebrasSIAM Journal on Computing, Vol. 34, No. 3 | 27 July 2006
- Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism DualitySIAM Journal on Discrete Mathematics, Vol. 19, No. 4 | 1 August 2006
- Tractable Clones of Polynomials over SemigroupsPrinciples and Practice of Constraint Programming - CP 2005 | 1 Jan 2005
- The Core of a Countably Categorical StructureSTACS 2005 | 1 Jan 2005
- Linear datalog and bounded path duality of relational structuresLogical Methods in Computer Science, Vol. 1, No. 1 | 29 April 2005
- A discrete homotopy theory for binary reflexive structuresAdvances in Mathematics, Vol. 189, No. 2 | 1 Dec 2004
- Recognizing frozen variables in constraint satisfaction problemsTheoretical Computer Science, Vol. 329, No. 1-3 | 1 Dec 2004
- The complexity of counting homomorphisms seen from the other sideTheoretical Computer Science, Vol. 329, No. 1-3 | 1 Dec 2004
- On sufficient conditions for unsatisfiability of random formulasJournal of the ACM, Vol. 51, No. 2 | 1 March 2004
- Dichotomies for classes of homomorphism problems involving unary functionsTheoretical Computer Science, Vol. 314, No. 1-2 | 1 Feb 2004
- Compaction, Retraction, and Constraint SatisfactionSIAM Journal on Computing, Vol. 33, No. 4 | 17 February 2012
- Constraint Satisfaction, Complexity, and LogicMethods and Applications of Artificial Intelligence | 1 Jan 2004
- Identifying Efficiently Solvable Cases of Max CSPSTACS 2004 | 1 Jan 2004
- The Complexity of Boolean Constraint IsomorphismSTACS 2004 | 1 Jan 2004
- Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered DomainsAutomated Reasoning | 1 Jan 2004
- Computational Complexity Classification of Partition under Compaction and RetractionComputing and Combinatorics | 1 Jan 2004
- The Complexity of Partition FunctionsAutomata, Languages and Programming | 1 Jan 2004
- Quantified Constraint Satisfaction and 2-Semilattice PolymorphismsPrinciples and Practice of Constraint Programming – CP 2004 | 1 Jan 2004
- (Smart) Look-Ahead Arc Consistency and the Pursuit of CSP TractabilityPrinciples and Practice of Constraint Programming – CP 2004 | 1 Jan 2004
- Constraint Propagation as a Proof SystemPrinciples and Practice of Constraint Programming – CP 2004 | 1 Jan 2004
- View-Based Query Processing: On the Relationship Between Rewriting, Answering and LosslessnessDatabase Theory - ICDT 2005 | 1 Jan 2004
- Other Applications of Finite Model TheoryElements of Finite Model Theory | 1 Jan 2004
- First-order definable retraction problems for posets and reflexive graphsProceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004. | 1 Jan 2004
- A graph of a relational structure and constraint satisfaction problemsProceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004. | 1 Jan 2004
- Reasoning on regular path queriesACM SIGMOD Record, Vol. 32, No. 4 | 1 Dec 2003
- The complexity of minimal satisfiability problemsInformation and Computation, Vol. 187, No. 1 | 1 Nov 2003
- Learnability of quantified formulasTheoretical Computer Science, Vol. 306, No. 1-3 | 1 Sep 2003
- Reasoning about temporal relationsJournal of the ACM, Vol. 50, No. 5 | 1 September 2003
- Algebra complexity problems involving graph homomorphism, semigroups and the constraint satisfaction problemJournal of Complexity, Vol. 19, No. 2 | 1 Apr 2003
- List PartitionsSIAM Journal on Discrete Mathematics, Vol. 16, No. 3 | 1 August 2006
- The Complexity of the Extendibility Problem for Finite PosetsSIAM Journal on Discrete Mathematics, Vol. 17, No. 1 | 1 August 2006
- Acyclic Homomorphisms and Circular Colorings of DigraphsSIAM Journal on Discrete Mathematics, Vol. 17, No. 1 | 1 August 2006
- Solving Order Constraints in Logarithmic SpaceSTACS 2003 | 17 February 2003
- An Algebraic Approach to Multi-sorted ConstraintsPrinciples and Practice of Constraint Programming – CP 2003 | 1 Jan 2003
- Periodic Constraint Satisfaction Problems: Polynomial-Time AlgorithmsPrinciples and Practice of Constraint Programming – CP 2003 | 1 Jan 2003
- Soft Constraints: Complexity and MultimorphismsPrinciples and Practice of Constraint Programming – CP 2003 | 1 Jan 2003
- On the Complexity of Existential Pebble GamesComputer Science Logic | 1 Jan 2003
- Constraint Satisfaction with Countable Homogeneous TemplatesComputer Science Logic | 1 Jan 2003
- Quantified Constraints: Algorithms and ComplexityComputer Science Logic | 1 Jan 2003
- BibliographyConstraint Processing | 1 Jan 2003
- Strong near subgroups and left gyrogroupsJournal of Algebra, Vol. 259, No. 1 | 1 Jan 2003
- Bi‐arc graphs and the complexity of list homomorphismsJournal of Graph Theory, Vol. 42, No. 1 | 7 November 2002
- Connected and Loosely Connected List HomomorphismsGraph-Theoretic Concepts in Computer Science | 28 February 2003
- Towards a Predictive Computational Complexity TheoryAutomata, Languages and Programming | 25 June 2002
- Constraint Satisfaction Problems in Non-deterministic Logarithmic SpaceAutomata, Languages and Programming | 25 June 2002
- Constraint Satisfaction, Bounded Treewidth, and Finite-Variable LogicsPrinciples and Practice of Constraint Programming - CP 2002 | 2 September 2002
- SIGACT news complexity theory column 34ACM SIGACT News, Vol. 32, No. 4 | 1 December 2001
- Fanout limitations on constraint systemsTheoretical Computer Science, Vol. 255, No. 1-2 | 1 Mar 2001
- The Approximability of Constraint Satisfaction ProblemsSIAM Journal on Computing, Vol. 30, No. 6 | 27 July 2006
- Classification of Homomorphisms to Oriented Cycles and of k-Partite SatisfiabilitySIAM Journal on Discrete Mathematics, Vol. 14, No. 4 | 1 August 2006
- Satisfiability of Systems of Equations over Finite MonoidsMathematical Foundations of Computer Science 2001 | 5 September 2001
- Hypertree Decompositions: A SurveyMathematical Foundations of Computer Science 2001 | 5 September 2001
- The Complexity of Minimal Satisfiability ProblemsSTACS 2001 | 16 March 2001
- Gyrogroups and the decomposition of groups into twisted subgroups and subgroupsPacific Journal of Mathematics, Vol. 197, No. 1 | 1 Jan 2001
- Conjunctive-Query Containment and Constraint SatisfactionJournal of Computer and System Sciences, Vol. 61, No. 2 | 1 Oct 2000
- On homomorphisms to edge-coloured cyclesElectronic Notes in Discrete Mathematics, Vol. 5 | 1 Jul 2000
- Involutory decomposition of groups into twisted subgroups and subgroupsJournal of Group Theory, Vol. 3, No. 1 | 5 Jan 2000
- Constraint Satisfaction Problems and Finite AlgebrasAutomata, Languages and Programming | 18 February 2002
- What Is Query Rewriting?Cooperative Information Agents IV - The Future of Information Agents in Cyberspace | 1 Jan 2000
- Polynomials of Bounded Tree Width (Extended Abstract)Formal Power Series and Algebraic Combinatorics | 1 Jan 2000
- Learnability of Quantified FormulasComputational Learning Theory | 19 November 1999
- Closure Functions and Width 1 ProblemsPrinciples and Practice of Constraint Programming – CP’99 | 1 Jan 1999
- Exploiting Bipartiteness to Identify Yet Another Tractable Subclass of CSPPrinciples and Practice of Constraint Programming – CP’99 | 1 Jan 1999
- The complexity of constraint satisfaction: an algebraic approachStructural Theory of Automata, Semigroups, and Universal Algebra
- Unifying Themes in Finite Model TheoryFinite Model Theory and Its Applications
- A Logical Approach to Constraint SatisfactionFinite Model Theory and Its Applications
- First-Order Model Checking Problems Parameterized by the ModelLogic and Theory of Algorithms
- On Datalog vs. LFPAutomata, Languages and Programming
- Directed st-Connectivity Is Not Expressible in Symmetric DatalogAutomata, Languages and Programming
- Non-dichotomies in Constraint Satisfaction ComplexityAutomata, Languages and Programming
- Universal Algebra and Hardness Results for Constraint Satisfaction ProblemsAutomata, Languages and Programming
- On the Power of k-ConsistencyAutomata, Languages and Programming
- Affine Systems of Equations and Counting Infinitary LogicAutomata, Languages and Programming
- Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-CompleteMathematical Foundations of Computer Science 2007
- NP by Means of Lifts and ShadowsMathematical Foundations of Computer Science 2007
- Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal GraphsGraph-Theoretic Concepts in Computer Science
- Qualitative Temporal and Spatial Reasoning RevisitedComputer Science Logic
- Many Facets of DualitiesResearch Trends in Combinatorial Optimization
- Bounded Tree-Width and CSP-Related ProblemsAlgorithms and Computation
- A combinatorial characterization of resolution width18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.
- Parameterized complexity of constraint satisfaction problemsProceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.
- Functions of multiple-valued logic and the complexity of constraint satisfaction: a short survey33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.
- View-based query processing and constraint satisfactionProceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)
- Homomorphism closed vs. existential positive18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.
- Tractable conservative constraint satisfaction problems18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.
- Generalized Majority-Minority Operations are Tractable20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05)
- On Digraph Coloring Problems and Treewidth Duality20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05)
- A Characterisation of First-Order Constraint Satisfaction Problems21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)
- A dichotomy theorem for constraints on a three-element setThe 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
- The complexity of homomorphism and constraint satisfaction problems seen from the other side44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
- Towards a dichotomy theorem for the counting constraint satisfaction problem44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
View Options
Get Access
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].