On the algebraic structure of combinatorial problems
Data up to Jan 2025
Total Citations Per Year
Abstract
References (15)
Universal Algebra
1968 • 2,382 citations
The complexity of satisfiability problems
1978 • 1,763 citations
Networks of constraints: Fundamental properties and applications to picture processing
1974 • 1,283 citations
Closed systems of functions and predicates
1968 • 279 citations
Clones in universal algebra
1986 • 212 citations
On binary constraint problems
1994 • 193 citations
Computational Complexity
2013 • 178 citations
On the parallel complexity of discrete relaxation in constraint satisfaction networks
1990 • 138 citations
Characterising tractable constraints
1994 • 123 citations
MINIMAL CLONES I: THE FIVE TYPES
1986 • 85 citations
Fast parallel constraint satisfaction
1993 • 79 citations
A unifying framework for tractable constraints
1995 • 57 citations
An algebraic characterization of tractable constraints
1995 • 24 citations
On the complexity of colouring by superdigraphs of bipartite graphs
1992 • 18 citations
Deleted Work
1955 • 0 citations