On the public citation graph

A Simple Algorithm for Mal'tsev Constraints

0 signed · 142 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-48085-3_12openalex-snapshot
Closure Functions and Width 1 Problems
inferredcites →https://doi.org/10.1007/978-3-662-03088-2_3openalex-snapshot
Computational Complexity
inferredcites →https://doi.org/10.1007/s10472-005-1810-9openalex-snapshot
A new tractable class of constraint satisfaction problems
inferredcites →https://doi.org/10.1016/0004-3702(77)90007-8openalex-snapshot
Consistency in networks of relations
inferredcites →https://doi.org/10.1016/j.ic.2006.09.005openalex-snapshot
Towards a dichotomy theorem for the counting constraint satisfaction problem
inferredcites →https://doi.org/10.1016/s0004-3702(98)00022-8openalex-snapshot
Constraints, consistency and closure
inferredcites →https://doi.org/10.1016/s0304-3975(97)00230-2openalex-snapshot
On the algebraic structure of combinatorial problems
inferredcites →https://doi.org/10.1109/lics.2003.1210072openalex-snapshot
Tractable conservative constraint satisfaction problems
inferredcites →https://doi.org/10.1109/sfcs.2002.1181990openalex-snapshot
A dichotomy theorem for constraints on a three-element set
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/263867.263489openalex-snapshot
Closure properties of constraints
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures

What points at this work

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

inferred← citeshttps://doi.org/10.5281/zenodo.24025833zenodo-depositor-declared
inferred← citeshttps://doi.org/10.1007/11821069_51openalex-snapshot
Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture
inferred← citeshttps://doi.org/10.1007/11874683_13openalex-snapshot
Collapsibility in Infinite-Domain Quantified Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/978-3-030-06167-8_6openalex-snapshot
Constraint Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-031-24117-8_18openalex-snapshot
Constraint Satisfaction, Graph Isomorphism, and the Pebbling Comonad
inferred← citeshttps://doi.org/10.1007/978-3-319-23534-9_11openalex-snapshot
Is Polynomial Time Choiceless?
inferred← citeshttps://doi.org/10.1007/978-3-319-66158-2_11openalex-snapshot
Kernelization of Constraint Satisfaction Problems: A Study Through Universal Algebra
inferred← citeshttps://doi.org/10.1007/978-3-319-77313-1_1openalex-snapshot
Constraint Satisfaction Problems: Complexity and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_53openalex-snapshot
The Complexity of the Counting Constraint Satisfaction Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-70583-3_17openalex-snapshot
Quantified Constraint Satisfaction and the Polynomially Generated Powers Property
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_49openalex-snapshot
Affine Systems of Equations and Counting Infinitary Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-92800-3_4openalex-snapshot
Recent Results on the Algebraic Approach to the CSP
inferred← citeshttps://doi.org/10.1007/978-3-540-92800-3_8openalex-snapshot
Constraint Satisfaction Problems with Infinite Templates
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_52openalex-snapshot
SDP Gaps for 2-to-1 and Other Label-Cover Variants
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_14openalex-snapshot
On Maltsev Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_26openalex-snapshot
On the CSP Dichotomy Conjecture
inferred← citeshttps://doi.org/10.1007/978-3-642-33974-5_1openalex-snapshot
Background
inferred← citeshttps://doi.org/10.1007/978-3-642-33974-5_6openalex-snapshot
Tractable Languages
inferred← citeshttps://doi.org/10.1007/978-981-10-6147-9_5openalex-snapshot
Parameterized Complexity of the Workflow Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/s00012-011-0125-4openalex-snapshot
Quantified constraint satisfaction and the polynomially generated powers property
inferred← citeshttps://doi.org/10.1007/s00012-015-0323-6openalex-snapshot
Commutative idempotent groupoids and the constraint satisfaction problem
inferred← citeshttps://doi.org/10.1007/s00012-024-00865-5openalex-snapshot
Graphs of finite algebras: edges, and connectivity
inferred← citeshttps://doi.org/10.1007/s00012-026-00948-5openalex-snapshot
Smb algebras II: On the constraint satisfaction problem over semilattice of Mal’cev blocks
inferred← citeshttps://doi.org/10.1007/s00453-018-0498-2openalex-snapshot
On Singleton Arc Consistency for CSPs Defined by Monotone Patterns
inferred← citeshttps://doi.org/10.1007/s10601-008-9054-zopenalex-snapshot
Relatively quantified constraint satisfaction
inferred← citeshttps://doi.org/10.1007/s10601-015-9198-6openalex-snapshot
Tractability in constraint satisfaction problems: a survey
inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.10.003openalex-snapshot
Colouring, constraint satisfaction, and complexity
inferred← citeshttps://doi.org/10.1016/j.ejc.2010.11.002openalex-snapshot
Maltsev digraphs have a majority polymorphism
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.07.011openalex-snapshot
A new line of attack on the dichotomy conjecture
inferred← citeshttps://doi.org/10.1016/j.ic.2009.05.003openalex-snapshot
The complexity of constraint satisfaction games and QCSP
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104437openalex-snapshot
Constraint Satisfaction Problems over semilattice block Mal'tsev algebras
inferred← citeshttps://doi.org/10.1016/j.ipl.2016.09.009openalex-snapshot
Equivariant algorithms for constraint satisfaction problems over coset templates
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.10.007openalex-snapshot
Backdoors into heterogeneous classes of SAT and CSP
inferred← citeshttps://doi.org/10.1016/j.jsc.2015.06.008openalex-snapshot
Polynomial-time solvable #CSP problems via algebraic models and Pfaffian circuits
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.12.049openalex-snapshot
Affine systems of equations and counting infinitary logic
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.05.022openalex-snapshot
Hard constraint satisfaction problems have hard gaps at location 1
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1017/9781107337534openalex-snapshot
Complexity of Infinite-Domain Constraint Satisfaction
inferred← citeshttps://doi.org/10.1017/bsl.2015.25openalex-snapshot
THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA
inferred← citeshttps://doi.org/10.1090/s0002-9947-09-04874-0openalex-snapshot
Varieties with few subalgebras of powers
inferred← citeshttps://doi.org/10.1093/logcom/exr011openalex-snapshot
Horn versus full first-order: Complexity dichotomies in algebraic constraint satisfaction
inferred← citeshttps://doi.org/10.1109/ccc.2011.32openalex-snapshot
Non-negatively Weighted #CSP: An Effective Complexity Dichotomy
inferred← citeshttps://doi.org/10.1109/focs.2009.32openalex-snapshot
Constraint Satisfaction Problems of Bounded Width
inferred← citeshttps://doi.org/10.1109/focs.2017.37openalex-snapshot
A Dichotomy Theorem for Nonuniform CSPs
inferred← citeshttps://doi.org/10.1109/ismvl.2019.00037openalex-snapshot
Fine-Grained Complexity of Constraint Satisfaction Problems through Partial Polymorphisms: A Survey
inferred← citeshttps://doi.org/10.1109/lics.2007.38openalex-snapshot
Quantified Equality Constraints
inferred← citeshttps://doi.org/10.1109/lics.2007.50openalex-snapshot
Tractability and learnability arising from algebras with few subpowers
inferred← citeshttps://doi.org/10.1109/lics.2008.14openalex-snapshot
Maltsev + Datalog --≫ Symmetric Datalog
inferred← citeshttps://doi.org/10.1109/lics.2009.38openalex-snapshot
The Complexity of Global Cardinality Constraints
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.2015.51openalex-snapshot
Locally Finite Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1109/lics.2017.8005149openalex-snapshot
Constraint satisfaction problems over semilattice block Mal'tsev algebras
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470557openalex-snapshot
Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP
inferred← citeshttps://doi.org/10.1109/synasc.2014.56openalex-snapshot
CSPs and Connectedness: P/NP Dichotomy for Idempotent, Right Quasigroups
inferred← citeshttps://doi.org/10.1137/060668572openalex-snapshot
The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case
inferred← citeshttps://doi.org/10.1137/060669231openalex-snapshot
MAX ONES Generalized to Larger Domains
inferred← citeshttps://doi.org/10.1137/080725209openalex-snapshot
Quantified Equality Constraints
inferred← citeshttps://doi.org/10.1137/080743238openalex-snapshot
Congruence Distributivity Implies Bounded Width
inferred← citeshttps://doi.org/10.1137/090775646openalex-snapshot
Tractability and Learnability Arising from Algebras with Few Subpowers
inferred← citeshttps://doi.org/10.1137/1.9781611973402.26openalex-snapshot
Space complexity of list H-colouring: a dichotomy
inferred← citeshttps://doi.org/10.1137/1.9781611977073.46openalex-snapshot
CLAP: A New Algorithm for Promise CSPs
inferred← citeshttps://doi.org/10.1137/100811258openalex-snapshot
An Effective Dichotomy for the Counting Constraint Satisfaction Problem
inferred← citeshttps://doi.org/10.1137/15m1032314openalex-snapshot
Nonnegative Weighted #CSP: An Effective Complexity Dichotomy
inferred← citeshttps://doi.org/10.1137/16m1088107openalex-snapshot
Binarisation for Valued Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1137/19m128212xopenalex-snapshot
Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy
inferred← citeshttps://doi.org/10.1137/20m1312745openalex-snapshot
The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1137/22m1476435openalex-snapshot
CLAP: A New Algorithm for Promise CSPs
inferred← citeshttps://doi.org/10.1142/s0218196712500750openalex-snapshot
THE SUBPOWER MEMBERSHIP PROBLEM FOR MAL'CEV ALGEBRAS
inferred← citeshttps://doi.org/10.1142/s0219061321500203openalex-snapshot
Solving equation systems in ω-categorical algebras
inferred← citeshttps://doi.org/10.1145/1189056.1189076openalex-snapshot
A rendezvous of logic, complexity, and algebra
inferred← citeshttps://doi.org/10.1145/1536414.1536512openalex-snapshot
A new line of attack on the dichotomy conjecture
inferred← citeshttps://doi.org/10.1145/1592451.1592453openalex-snapshot
A rendezvous of logic, complexity, and algebra
inferred← citeshttps://doi.org/10.1145/1806689.1806789openalex-snapshot
On the complexity of #CSP
inferred← citeshttps://doi.org/10.1145/1970398.1970400openalex-snapshot
Complexity of conservative constraint satisfaction problems
inferred← citeshttps://doi.org/10.1145/2078162.2078177openalex-snapshot
Guest column
inferred← citeshttps://doi.org/10.1145/2213977.2214059openalex-snapshot
Complexity of counting CSP with complex weights
inferred← citeshttps://doi.org/10.1145/2382196.2382287openalex-snapshot
On the parameterized complexity of the workflow satisfiability problem
inferred← citeshttps://doi.org/10.1145/2556646openalex-snapshot
Constraint Satisfaction Problems Solvable by Local Consistency Methods
inferred← citeshttps://doi.org/10.1145/2603088.2603135openalex-snapshot
Turing machines with atoms, constraint satisfaction problems, and descriptive complexity
inferred← citeshttps://doi.org/10.1145/2677161.2677165openalex-snapshot
Constraint satisfaction problem and universal algebra
inferred← citeshttps://doi.org/10.1145/2822891openalex-snapshot
Complexity of Counting CSP with Complex Weights
inferred← citeshttps://doi.org/10.1145/2933575.2933587openalex-snapshot
The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns
inferred← citeshttps://doi.org/10.1145/2933575.2933604openalex-snapshot
Graphs of relational structures
inferred← citeshttps://doi.org/10.1145/3134757openalex-snapshot
Asking the Metaquestions in Constraint Tractability
inferred← citeshttps://doi.org/10.1145/3292048.3292050openalex-snapshot
Constraint satisfaction problems
inferred← citeshttps://doi.org/10.1145/3389411openalex-snapshot
Sparsification of SAT and CSP Problems via Tractable Extensions
inferred← citeshttps://doi.org/10.1145/3492336openalex-snapshot
The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems
inferred← citeshttps://doi.org/10.1145/3559736.3559740openalex-snapshot
An invitation to the promise constraint satisfaction problem
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.9111openalex-snapshot
Backdoors into Heterogeneous Classes of SAT and CSP
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9749openalex-snapshot
Binarisation via Dualisation for Valued Constraints
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10432openalex-snapshot
The Meta-Problem for Conservative Mal'tsev Constraints
inferred← citeshttps://doi.org/10.1609/aaai.v34i02.5499openalex-snapshot
Chain Length and CSPs Learnable with Few Queries
inferred← citeshttps://doi.org/10.1613/jair.3534openalex-snapshot
Algorithms and Limits for Compact Plan Representations
inferred← citeshttps://doi.org/10.1613/jair.3747openalex-snapshot
Tractable Set Constraints
inferred← citeshttps://doi.org/10.2168/lmcs-6(4:4)2010openalex-snapshot
The complexity of global cardinality constraints
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.23638/lmcs-13(4:26)2017openalex-snapshot
The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns
inferred← citeshttps://doi.org/10.3233/978-1-61499-098-7-85openalex-snapshot
Macros, Reactive Plans and Compact Representations
inferred← citeshttps://doi.org/10.32920/23459144openalex-snapshot
Expressibility Of Constraint Satisfaction Problems In Extensions Of First-Order Logic
inferred← citeshttps://doi.org/10.32920/23459144.v1openalex-snapshot
Expressibility Of Constraint Satisfaction Problems In Extensions Of First-Order Logic
inferred← citeshttps://doi.org/10.32920/ryerson.14649945openalex-snapshot
Circuit Complexity Of Constraint Satisfaction Problems With Few Subpowers
inferred← citeshttps://doi.org/10.32920/ryerson.14649945.v1openalex-snapshot
Circuit Complexity Of Constraint Satisfaction Problems With Few Subpowers
inferred← citeshttps://doi.org/10.32920/ryerson.14653140openalex-snapshot
Constraint satisfaction problems in the logic LFP +rank
inferred← citeshttps://doi.org/10.32920/ryerson.14653140.v1openalex-snapshot
Constraint satisfaction problems in the logic LFP +rank
inferred← citeshttps://doi.org/10.3384/diss.diva-116859openalex-snapshot
On Some Combinatorial Optimization Problems : Algorithms and Complexity
inferred← citeshttps://doi.org/10.37236/4419openalex-snapshot
On Maltsev Digraphs
inferred← citeshttps://doi.org/10.4171/jems/472openalex-snapshot
On the number of finite algebraic structures
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.csl.2015.41openalex-snapshot
First-Order Queries on Finite Abelian Groups
inferred← citeshttps://doi.org/10.4230/lipics.csl.2017.42openalex-snapshot
An Algebraic Approach to Valued Constraint Satisfaction
inferred← citeshttps://doi.org/10.46298/theoretics.24.14openalex-snapshot
Unifying the Three Algebraic Approaches to the CSP via Minimal Taylor Algebras
inferred← citeshttps://doi.org/10.48550/arxiv.1003.3879openalex-snapshot
An Effective Dichotomy for the Counting Constraint Satisfaction Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1012.5659openalex-snapshot
Non-negative Weighted #CSPs: An Effective Complexity Dichotomy
inferred← citeshttps://doi.org/10.48550/arxiv.1502.05912openalex-snapshot
Limitations of Algebraic Approaches to Graph Isomorphism Testing
inferred← citeshttps://doi.org/10.48550/arxiv.1609.03943openalex-snapshot
A Constraint Satisfaction Problem Algorithm for Certain 2-Semilattice-over-Edge Algebras
inferred← citeshttps://doi.org/10.48550/arxiv.1701.02409openalex-snapshot
Dichotomy for Digraph Homomorphism Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1707.09440openalex-snapshot
Refuting Feder, Kinne and Rafiey
inferred← citeshttps://doi.org/10.48550/arxiv.1709.08311openalex-snapshot
A new algorithm for constraint satisfaction problems with Maltsev templates
inferred← citeshttps://doi.org/10.48550/arxiv.1711.01943openalex-snapshot
A new algorithm for constraint satisfaction problems with few subpowers templates
inferred← citeshttps://doi.org/10.48550/arxiv.2006.10239openalex-snapshot
Local structure of idempotent algebras II
inferred← citeshttps://doi.org/10.48550/arxiv.2006.11713openalex-snapshot
Graphs of relational structures: restricted types
inferred← citeshttps://doi.org/10.48550/arxiv.2007.09099openalex-snapshot
A dichotomy theorem for nonuniform CSPs simplified
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0602047openalex-snapshot
Approximability of Integer Programming with Generalised Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0611018openalex-snapshot
Logic Column 17: A Rendezvous of Logic, Complexity, and Algebra
inferred← citeshttps://doi.org/10.5287/ora-agmz4yeb8openalex-snapshot
Hybrid tractability of constraint satisfaction problems with global constraints
inferred← citeshttps://doi.org/10.5591/978-1-57735-516-8/ijcai11-093openalex-snapshot
Tractable set constraints
inferred← citeshttps://doi.org/10.82308/6712openalex-snapshot
The complexity of constraint satisfaction problems and symmetric Datalog /
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.