On the complexity of H-coloring
Journal of Combinatorial Theory Series B
Capturing complexity classes by fragments of second-order logic
Theoretical Computer Science - Special issue on logic and applications to computer science
Monotone monadic SNP and constraint satisfaction
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Resolution for quantified Boolean formulas
Information and Computation
Closure properties of constraints
Journal of the ACM (JACM)
On the algebraic structure of combinatorial problems
Theoretical Computer Science
Constraints, consistency and closure
Artificial Intelligence
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
Closure Functions and Width 1 Problems
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
On the Computational Complexity of Quantified Horn Clauses
CSL '87 Proceedings of the 1st Workshop on Computer Science Logic
Tractable conservative Constraint Satisfaction Problems
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey
ISMVL '03 Proceedings of the 33rd International Symposium on Multiple-Valued Logic
A Graph of a Relational Structure and Constraint Satisfaction Problems
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
On Digraph Coloring Problems and Treewidth Duality
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Generalized Majority-Minority Operations are Tractable
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
A Simple Algorithm for Mal'tsev Constraints
SIAM Journal on Computing
H-Coloring dichotomy revisited
Theoretical Computer Science - Graph colorings
A Characterisation of First-Order Constraint Satisfaction Problems
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
On Tractability and Congruence Distributivity
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
The complexity of equality constraint languages
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Collapsibility in infinite-domain quantified constraint satisfaction
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
The complexity of satisfiability problems: refining Schaefer's theorem
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
The core of a countably categorical structure
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Computational Complexity of Constraint Satisfaction
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Quantified Constraint Satisfaction and the Polynomially Generated Powers Property
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Complexity of Constraints
Theoretical Computer Science
The complexity of conservative valued CSPs
Journal of the ACM (JACM)
| Hi-index | 0.00 |
I am always looking for contributions. If you have any suggestion concerning the content of the Logic Column, or if you would like to contribute by writing a column yourself, feel free to get in touch with me.