On the public citation graph

Congruence Distributivity Implies Bounded Width

0 signed · 51 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-45022-x_24openalex-snapshot
Constraint Satisfaction Problems and Finite Algebras
inferredcites →https://doi.org/10.1007/978-3-540-92800-3_4openalex-snapshot
Recent Results on the Algebraic Approach to the CSP
inferredcites →https://doi.org/10.1007/978-3-540-92800-3_5openalex-snapshot
Dualities for Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1007/s00012-007-2012-6openalex-snapshot
Bounded width problems and algebras
inferredcites →https://doi.org/10.1007/s00012-009-2113-5openalex-snapshot
CD(4) has bounded width
inferredcites →https://doi.org/10.1016/0020-0255(74)90008-5openalex-snapshot
Networks of constraints: Fundamental properties and applications to picture processing
inferredcites →https://doi.org/10.1016/0020-0255(94)00080-uopenalex-snapshot
Constraint satisfaction in prolog: Complexity and theory-based heuristics
inferredcites →https://doi.org/10.1016/0095-8956(90)90132-jopenalex-snapshot
On the complexity of H-coloring
inferredcites →https://doi.org/10.1016/j.jalgebra.2004.07.044openalex-snapshot
Combinatorial problems raised from 2-semilattices
inferredcites →https://doi.org/10.1017/s0890060400002651openalex-snapshot
Automobile transmission design as a constraint satisfaction problem: modelling the kinematic level
inferredcites →https://doi.org/10.1023/a:1009609327253openalex-snapshot
Engineering Dynamic Scheduler for Work Manager
inferredcites →https://doi.org/10.1023/a:1009717525330openalex-snapshot
Temporal Constraints: A Survey
inferredcites →https://doi.org/10.1090/conm/076openalex-snapshot
The structure of finite algebras
inferredcites →https://doi.org/10.1090/s0002-9947-09-04874-0openalex-snapshot
Varieties with few subalgebras of powers
inferredcites →https://doi.org/10.1109/focs.2009.32openalex-snapshot
Constraint Satisfaction Problems of Bounded Width
inferredcites →https://doi.org/10.1109/lics.2003.1210072openalex-snapshot
Tractable conservative constraint satisfaction problems
inferredcites →https://doi.org/10.1137/050628957openalex-snapshot
A Simple Algorithm for Mal'tsev Constraints
inferredcites →https://doi.org/10.1137/070708093openalex-snapshot
The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
inferredcites →https://doi.org/10.1137/090775646openalex-snapshot
Tractability and Learnability Arising from Algebras with Few Subpowers
inferredcites →https://doi.org/10.1137/s0097539700376676openalex-snapshot
Classifying the Complexity of Constraints Using Finite Algebras
inferredcites →https://doi.org/10.1137/s0097539794266766openalex-snapshot
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
inferredcites →https://doi.org/10.1145/1120582.1120584openalex-snapshot
A dichotomy theorem for constraint satisfaction problems on a 3-element set
inferredcites →https://doi.org/10.1145/1374376.1374488openalex-snapshot
Graphs, polymorphisms and the complexity of homomorphism problems
inferredcites →https://doi.org/10.1145/1970398.1970400openalex-snapshot
Complexity of conservative constraint satisfaction problems
inferredcites →https://doi.org/10.1145/263867.263489openalex-snapshot
Closure properties of constraints
inferredcites →https://doi.org/10.1145/335168.335209openalex-snapshot
Constraint satisfaction and database theory
inferredcites →https://doi.org/10.1145/800133.804350openalex-snapshot
The complexity of satisfiability problems
inferredcites →https://doi.org/10.2168/lmcs-2(4:1)2006openalex-snapshot
Generalized Majority-Minority Operations are Tractable
inferredcites →https://doi.org/10.2168/lmcs-3(2:6)2007openalex-snapshot
On tractability and congruence distributivity
inferredcites →https://doi.org/10.2307/2586531openalex-snapshot
A finite basis theorem for residually finite, congruence meet-semidistributive varieties
inferredcites →https://doi.org/10.7146/math.scand.a-10850openalex-snapshot
Algebras Whose Congruence Lattices are Distributive.
inferredcites →https://doi.org/10.7551/mitpress/12761.003.0007openalex-snapshot
Natural Language Understanding

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s00012-014-0283-2openalex-snapshot
Decidability of absorption in relational structures of bounded width
inferred← citeshttps://doi.org/10.1007/s00012-017-0440-5openalex-snapshot
Deciding absorption in relational structures
inferred← citeshttps://doi.org/10.1016/j.disc.2012.03.040openalex-snapshot
Reflexive digraphs with near unanimity polymorphisms
inferred← citeshttps://doi.org/10.1017/bsl.2015.25openalex-snapshot
THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA
inferred← citeshttps://doi.org/10.1109/focs.2009.32openalex-snapshot
Constraint Satisfaction Problems of Bounded Width
inferred← citeshttps://doi.org/10.1109/lics.2010.34openalex-snapshot
New Conditions for Taylor Varieties and CSP
inferred← citeshttps://doi.org/10.1109/lics.2011.25openalex-snapshot
The Dichotomy for Conservative Constraint Satisfaction Problems Revisited
inferred← citeshttps://doi.org/10.1109/lics.2012.24openalex-snapshot
Near Unanimity Constraints Have Bounded Pathwidth Duality
inferred← citeshttps://doi.org/10.1142/s0218196716500430openalex-snapshot
Deciding absorption
inferred← citeshttps://doi.org/10.1145/2556646openalex-snapshot
Constraint Satisfaction Problems Solvable by Local Consistency Methods
inferred← citeshttps://doi.org/10.1145/2677161.2677165openalex-snapshot
Constraint satisfaction problem and universal algebra
inferred← citeshttps://doi.org/10.2168/lmcs-11(2:15)2015openalex-snapshot
On absorption in semigroups and $n$-ary semigroups
inferred← citeshttps://doi.org/10.2168/lmcs-8(1:7)2012openalex-snapshot
Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
inferred← citeshttps://doi.org/10.32920/19775380openalex-snapshot
Topics in Graph Burning and Datalog
inferred← citeshttps://doi.org/10.32920/19775380.v1openalex-snapshot
Topics in Graph Burning and Datalog
inferred← citeshttps://doi.org/10.4153/cjm-2011-087-3openalex-snapshot
Finitely Related Algebras In Congruence Distributive Varieties Have Near Unanimity Terms
inferred← citeshttps://doi.org/10.4171/jems/790openalex-snapshot
Finitely related algebras in congruence modular varieties have few subpowers
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2020.110openalex-snapshot
Sensitive Instances of the Constraint Satisfaction Problem
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2021.138openalex-snapshot
Smooth Approximations and Relational Width Collapses
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.