On the public citation graph

Galois theory for post algebras. I

https://doi.org/10.1007/bf01070906
0 signed · 222 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.1002/mana.19630270108openalex-snapshot
Algebras with a Scheme of Operators
inferredcites →https://doi.org/10.2307/2370324openalex-snapshot
Introduction to a General Theory of Elementary Propositions
inferredcites →https://doi.org/10.2307/2371821openalex-snapshot
An Extension of Klein's Erlanger Program: Logic as Invariant-Theory

What points at this work

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

inferred← citeshttps://doi.org/10.1002/mana.19831100105openalex-snapshot
Short maximal chains in the lattice of clones over a finite set
inferred← citeshttps://doi.org/10.1007/1-4020-3817-8_4openalex-snapshot
Completeness of uniformly delayed operations
inferred← citeshttps://doi.org/10.1007/11753728_14openalex-snapshot
The Complexity of Equality Constraint Languages
inferred← citeshttps://doi.org/10.1007/978-1-4020-1898-5_5openalex-snapshot
Galois Connections for Operations and Relations
inferred← citeshttps://doi.org/10.1007/978-1-4020-1898-5_7openalex-snapshot
Q-Independence and Weak Automorphisms
inferred← citeshttps://doi.org/10.1007/978-3-030-25027-0_1openalex-snapshot
Algebraic Theory of Promise Constraint Satisfaction Problems, First Steps
inferred← citeshttps://doi.org/10.1007/978-3-031-52113-3_34openalex-snapshot
On the Induced Problem for Fixed-Template CSPs
inferred← citeshttps://doi.org/10.1007/978-3-540-45220-1_5openalex-snapshot
Constraint Satisfaction with Countable Homogeneous Templates
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_80openalex-snapshot
Computational Complexity of Constraint Satisfaction
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-74456-6_16openalex-snapshot
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_10openalex-snapshot
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint
inferred← citeshttps://doi.org/10.1007/978-3-540-92800-3_2openalex-snapshot
Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?
inferred← citeshttps://doi.org/10.1007/978-3-540-92800-3_3openalex-snapshot
Basics of Galois Connections
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-540-92800-3_9openalex-snapshot
Partial Polymorphisms and Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-02716-1_1openalex-snapshot
Presenting Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_36openalex-snapshot
Extensions of the Minimum Cost Homomorphism Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_4openalex-snapshot
Testing Expressibility Is Hard
inferred← citeshttps://doi.org/10.1007/978-3-642-22012-8_27openalex-snapshot
Generic Expression Hardness Results for Primitive Positive Formula Comparison
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_23openalex-snapshot
An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection
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_2openalex-snapshot
Expressibility of Valued Constraints
inferred← citeshttps://doi.org/10.1007/978-3-662-55751-8_6openalex-snapshot
Generalized Satisfiability Problems via Operator Assignments
inferred← citeshttps://doi.org/10.1007/978-94-010-1161-7_7openalex-snapshot
A Survey of Many-Valued Logic (1966–1974)
inferred← citeshttps://doi.org/10.1007/978-94-011-5678-3_14openalex-snapshot
On Closed Classes in k-Valued Logic which Contain a Homogeneous Switching Function
inferred← citeshttps://doi.org/10.1007/bf01068296openalex-snapshot
The question of definability in the simple predicate calculus on a finite model without equality
inferred← citeshttps://doi.org/10.1007/bf01068640openalex-snapshot
Functional completeness in P2×Pk
inferred← citeshttps://doi.org/10.1007/bf01068819openalex-snapshot
Uniprimitive bases of maximum post subalgebras
inferred← citeshttps://doi.org/10.1007/bf01068997openalex-snapshot
Derivation of basicity criteria for permutation groups and transformation semigroups from a theorem of Rosenberg
inferred← citeshttps://doi.org/10.1007/bf01069627openalex-snapshot
The algebras of partial functions and their invariants
inferred← citeshttps://doi.org/10.1007/bf01069655openalex-snapshot
Galois correspondence between iterative post algebras and relations on an infinite set
inferred← citeshttps://doi.org/10.1007/bf01069828openalex-snapshot
Post algebras of type F 4 ?
inferred← citeshttps://doi.org/10.1007/bf01070526openalex-snapshot
On the formulability of predicates on finite models
inferred← citeshttps://doi.org/10.1007/bf01071086openalex-snapshot
Representations in many-valued logics
inferred← citeshttps://doi.org/10.1007/bf01071360openalex-snapshot
Number of maximal closed, under superposition, classes of function over a finite family of finite sets
inferred← citeshttps://doi.org/10.1007/bf01071385openalex-snapshot
Local characteristics of post algebras. II
inferred← citeshttps://doi.org/10.1007/bf01099358openalex-snapshot
Maximal subalgebras of algebras of partial multivalued logic functions
inferred← citeshttps://doi.org/10.1007/bf01787700openalex-snapshot
Galois correspondence between permutation groups and cellular rings (association schemes)
inferred← citeshttps://doi.org/10.1007/bf01899542openalex-snapshot
Algebras of prime cardinality with a cyclic automorphism
inferred← citeshttps://doi.org/10.1007/bf02366421openalex-snapshot
Algebra of algorithms and Kaluzhnin's graphschemas
inferred← citeshttps://doi.org/10.1007/bf02485391openalex-snapshot
The subalgebra systems of direct powers
inferred← citeshttps://doi.org/10.1007/bf02671739openalex-snapshot
Sublattices of a lattice of clones of functions on a 3-element set. II
inferred← citeshttps://doi.org/10.1007/bf02742065openalex-snapshot
Functional completeness in iterative meta-algebras
inferred← citeshttps://doi.org/10.1007/bfb0063443openalex-snapshot
Galois theory for partial algebras
inferred← citeshttps://doi.org/10.1007/s00012-004-1884-yopenalex-snapshot
Relations compatible with near unanimity operations
inferred← citeshttps://doi.org/10.1007/s00012-005-1922-4openalex-snapshot
Subdirect products of hereditary congruence lattices
inferred← citeshttps://doi.org/10.1007/s00012-007-1985-5openalex-snapshot
Clones on three elements preserving a binary relation
inferred← citeshttps://doi.org/10.1007/s00012-007-2010-8openalex-snapshot
Almost distributive sublattices and congruence heredity
inferred← citeshttps://doi.org/10.1007/s00012-007-2012-6openalex-snapshot
Bounded width problems and algebras
inferred← citeshttps://doi.org/10.1007/s00012-008-2100-2openalex-snapshot
A survey of clones on infinite sets
inferred← citeshttps://doi.org/10.1007/s00012-009-2110-8openalex-snapshot
Primitive positive clones of groupoids
inferred← citeshttps://doi.org/10.1007/s00012-011-0159-7openalex-snapshot
Endolocality meets homomorphism-homogeneity: a new approach in the study of relational algebras
inferred← citeshttps://doi.org/10.1007/s00012-012-0184-1openalex-snapshot
Galois theory for sets of operations closed under permutation, cylindrification, and composition
inferred← citeshttps://doi.org/10.1007/s00012-012-0207-yopenalex-snapshot
The cardinality of the set of all clones containing a given minimal clone on three elements
inferred← citeshttps://doi.org/10.1007/s00012-012-0209-9openalex-snapshot
A general Galois theory for operations and relations in arbitrary categories
inferred← citeshttps://doi.org/10.1007/s00012-013-0244-1openalex-snapshot
Meet-irreducible submaximal clones determined by nontrivial equivalence relations
inferred← citeshttps://doi.org/10.1007/s00012-013-0259-7openalex-snapshot
The existence of a near-unanimity function is decidable
inferred← citeshttps://doi.org/10.1007/s00012-014-0270-7openalex-snapshot
Lattices of equivalence relations closed under the operations of relation algebras
inferred← citeshttps://doi.org/10.1007/s00012-015-0336-1openalex-snapshot
Boolean max-co-clones
inferred← citeshttps://doi.org/10.1007/s00012-015-0358-8openalex-snapshot
CSP for binary conservative relational structures
inferred← citeshttps://doi.org/10.1007/s00012-016-0369-0openalex-snapshot
Weakly extendable partial clones on an infinite set
inferred← citeshttps://doi.org/10.1007/s00012-016-0407-yopenalex-snapshot
Galois theory for semiclones
inferred← citeshttps://doi.org/10.1007/s00012-017-0440-5openalex-snapshot
Deciding absorption in relational structures
inferred← citeshttps://doi.org/10.1007/s00012-018-0497-9openalex-snapshot
Unique inclusions of maximal C-clones in maximal clones
inferred← citeshttps://doi.org/10.1007/s00012-018-0499-7openalex-snapshot
Galois connection for multiple-output operations
inferred← citeshttps://doi.org/10.1007/s00012-018-0561-5openalex-snapshot
Endpoints of associated intervals for local clones on an infinite set
inferred← citeshttps://doi.org/10.1007/s00012-020-00700-7openalex-snapshot
Existence of cube terms in finite algebras
inferred← citeshttps://doi.org/10.1007/s00012-020-0639-8openalex-snapshot
Solution sets of systems of equations over finite lattices and semilattices
inferred← citeshttps://doi.org/10.1007/s00012-024-00852-wopenalex-snapshot
Submaximal clones over a three-element set up to minor-equivalence
inferred← citeshttps://doi.org/10.1007/s000120050159openalex-snapshot
A constructive approach to the finite congruence lattice representation problem
inferred← citeshttps://doi.org/10.1007/s00037-014-0093-0openalex-snapshot
Testing list H-homomorphisms
inferred← citeshttps://doi.org/10.1007/s00224-007-9083-9openalex-snapshot
The Complexity of Equality Constraint Languages
inferred← citeshttps://doi.org/10.1007/s00224-010-9302-7openalex-snapshot
On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas
inferred← citeshttps://doi.org/10.1007/s00233-012-9455-6openalex-snapshot
On finitely related semigroups
inferred← citeshttps://doi.org/10.1007/s10559-007-0101-3openalex-snapshot
Formalization of algorithmic knowledge of object domains in terms of the algebra of algorithmics
inferred← citeshttps://doi.org/10.1007/s10601-022-09340-1openalex-snapshot
The algebraic structure of the densification and the sparsification tasks for CSPs
inferred← citeshttps://doi.org/10.1007/s11083-016-9394-zopenalex-snapshot
Rigid Binary Relations on a 4-Element Domain
inferred← citeshttps://doi.org/10.1007/s11225-012-9450-7openalex-snapshot
Lewis Dichotomies in Many-Valued Logics
inferred← citeshttps://doi.org/10.1007/s11787-015-0117-9openalex-snapshot
Existence of Finite Total Equivalence Systems for Certain Closed Classes of 3-Valued Logic Functions
inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.10.003openalex-snapshot
Colouring, constraint satisfaction, and complexity
inferred← citeshttps://doi.org/10.1016/j.dam.2003.01.002openalex-snapshot
Post classes characterized by functional terms
inferred← citeshttps://doi.org/10.1016/j.dam.2008.07.012openalex-snapshot
Homogeneous and strictly homogeneous criteria for partial structures
inferred← citeshttps://doi.org/10.1016/j.dam.2025.01.001openalex-snapshot
Positive existential definability in finite structures
inferred← citeshttps://doi.org/10.1016/j.disc.2005.11.033openalex-snapshot
The completeness problem in partial hyperclones
inferred← citeshttps://doi.org/10.1016/j.disc.2007.06.018openalex-snapshot
On Boolean primitive positive clones
inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.080openalex-snapshot
Extendable local partial clones
inferred← citeshttps://doi.org/10.1016/j.disc.2008.04.055openalex-snapshot
A surprising permanence of old motivations (a not-so-rigid story)
inferred← citeshttps://doi.org/10.1016/j.ejc.2009.02.007openalex-snapshot
A combinatorial constraint satisfaction problem dichotomy classification conjecture
inferred← citeshttps://doi.org/10.1016/j.entcs.2014.02.006openalex-snapshot
A Short Introduction to Clones
inferred← citeshttps://doi.org/10.1016/j.entcs.2014.02.008openalex-snapshot
Logical Relations and Parametricity – A Reynolds Programme for Category Theory and Programming Languages
inferred← citeshttps://doi.org/10.1016/j.ic.2012.10.008openalex-snapshot
Generic expression hardness results for primitive positive formula comparison
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.07.008openalex-snapshot
Strong partial clones and the time complexity of SAT problems
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.05.003openalex-snapshot
Generalized satisfiability problems via operator assignments
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.10.004openalex-snapshot
Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem
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/s0166-218x(00)00370-xopenalex-snapshot
A-closed classes of idempotent functions of many-valued logic definable by binary relations
inferred← citeshttps://doi.org/10.1017/bsl.2015.25openalex-snapshot
THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA
inferred← citeshttps://doi.org/10.1017/s0004972700014301openalex-snapshot
Natural duality via a finite set of relations
inferred← citeshttps://doi.org/10.1023/a:1005946705819openalex-snapshot
Completeness for Uniformly Delayed Circuits, A Survey
inferred← citeshttps://doi.org/10.1023/a:1022632925246openalex-snapshot
Iterative Algebras without Projections
inferred← citeshttps://doi.org/10.1070/rm1974v029n04abeh001294openalex-snapshot
LEV ARKAD'EVICH KALUZHIN (on the occasion of his sixtieth birthday)
inferred← citeshttps://doi.org/10.1070/sm1972v016n01abeh001352openalex-snapshot
ON CERTAIN MAXIMAL SUBGROUPS OF SYMMETRIC AND ALTERNATING GROUPS
inferred← citeshttps://doi.org/10.1080/00927872.2013.763256openalex-snapshot
A Generalized Version of the Baker–Pixley Theorem
inferred← citeshttps://doi.org/10.1090/s0002-9939-1987-0908642-5openalex-snapshot
Finitely Many Primitive Positive Clones
inferred← citeshttps://doi.org/10.1093/jigpal/jzae077openalex-snapshot
Functional completeness and primitive positive decomposition of relations on finite domains
inferred← citeshttps://doi.org/10.1093/logcom/exi083openalex-snapshot
Constraint Satisfaction with Countable Homogeneous Templates
inferred← citeshttps://doi.org/10.1093/logcom/exw005openalex-snapshot
The power of primitive positive definitions with polynomially many variables
inferred← citeshttps://doi.org/10.1103/physreva.86.030301openalex-snapshot
Undecidability in tensor network states
inferred← citeshttps://doi.org/10.1109/ccc.2012.9openalex-snapshot
Testing List H-homomorphisms
inferred← citeshttps://doi.org/10.1109/ismvl.1994.302202openalex-snapshot
The completeness problem on the product of algebras of finite-valued logic
inferred← citeshttps://doi.org/10.1109/ismvl.1995.513514openalex-snapshot
Completeness theory for vector partial multiple-valued logic functions
inferred← citeshttps://doi.org/10.1109/ismvl.1998.679509openalex-snapshot
Multiple-valued hyperstructures
inferred← citeshttps://doi.org/10.1109/ismvl.2002.1011063openalex-snapshot
Some results on the centralizers of monoids in clone theory
inferred← citeshttps://doi.org/10.1109/ismvl.2002.1011064openalex-snapshot
Partial hyperclones on a finite set
inferred← citeshttps://doi.org/10.1109/ismvl.2004.1319928openalex-snapshot
Algebraic properties of totally irreducible elements of clone lattices
inferred← citeshttps://doi.org/10.1109/ismvl.2004.1319930openalex-snapshot
Some properties of local partial clones on an infinite set
inferred← citeshttps://doi.org/10.1109/ismvl.2005.43openalex-snapshot
Semirigid Equivalence Relations - A New Proof Method
inferred← citeshttps://doi.org/10.1109/ismvl.2006.15openalex-snapshot
Commuting Hyperoperations
inferred← citeshttps://doi.org/10.1109/ismvl.2007.50openalex-snapshot
Restriction-Closed Hyperclones
inferred← citeshttps://doi.org/10.1109/ismvl.2008.47openalex-snapshot
Semirigid Equivalence Relations on a Finite Set
inferred← citeshttps://doi.org/10.1109/ismvl.2009.20openalex-snapshot
Positive Primitive Structures
inferred← citeshttps://doi.org/10.1109/ismvl.2010.30openalex-snapshot
Classes of Operations Closed under Permutation, Cylindrification and Composition
inferred← citeshttps://doi.org/10.1109/ismvl.2011.14openalex-snapshot
Galois Theory for Partial Clones and Some Relational Clones
inferred← citeshttps://doi.org/10.1109/ismvl.2012.22openalex-snapshot
On the Generation of (Minimal) Clones Containing Near-Unanimity Operations
inferred← citeshttps://doi.org/10.1109/ismvl.2012.46openalex-snapshot
Counting Predicates, Subset Surjective Functions, and Counting CSPs
inferred← citeshttps://doi.org/10.1109/ismvl.2012.47openalex-snapshot
The Cardinality of the Set of All Clones Containing a Given Minimal Clone
inferred← citeshttps://doi.org/10.1109/ismvl.2013.16openalex-snapshot
Boolean Max-Co-Clones
inferred← citeshttps://doi.org/10.1109/ismvl.2013.18openalex-snapshot
Clones of Partial Cofunctions
inferred← citeshttps://doi.org/10.1109/ismvl.2013.48openalex-snapshot
On the Semigroup of Equational Classes of Finite Functions
inferred← citeshttps://doi.org/10.1109/ismvl.2014.18openalex-snapshot
Maximal and Minimal Closed Classes in Multiple-Valued Logic
inferred← citeshttps://doi.org/10.1109/ismvl.2014.23openalex-snapshot
Polynomially Closed Co-clones
inferred← citeshttps://doi.org/10.1109/ismvl.2014.24openalex-snapshot
Partial R-Clones
inferred← citeshttps://doi.org/10.1109/ismvl.2015.33openalex-snapshot
Bounded Bases of Strong Partial Clones
inferred← citeshttps://doi.org/10.1109/ismvl.2019.00014openalex-snapshot
The Inclusion Structure of Boolean Weak Bases
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.2009.38openalex-snapshot
The Complexity of Global Cardinality Constraints
inferred← citeshttps://doi.org/10.1109/lics.2010.13openalex-snapshot
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction
inferred← citeshttps://doi.org/10.1109/lics.2010.34openalex-snapshot
New Conditions for Taylor Varieties and CSP
inferred← citeshttps://doi.org/10.1109/lics.2012.24openalex-snapshot
Near Unanimity Constraints Have Bounded Pathwidth Duality
inferred← citeshttps://doi.org/10.1109/lics.2017.8005116openalex-snapshot
The complexity of minimal inference problem for conservative constraint languages
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/lics56636.2023.10175732openalex-snapshot
Symmetries of Graphs and Structures that Fail to Interpret a Finite Thing
inferred← citeshttps://doi.org/10.1134/s1990478907030118openalex-snapshot
A completeness theorem in the class of quasimonotonic functions
inferred← citeshttps://doi.org/10.1134/s1990478908040108openalex-snapshot
Discriminator positively complete classes of ternary logic
inferred← citeshttps://doi.org/10.1137/130906398openalex-snapshot
An Algebraic Theory of Complexity for Discrete Optimization
inferred← citeshttps://doi.org/10.1137/130915479openalex-snapshot
Robustly Solvable Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1137/18m1216213openalex-snapshot
Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems)
inferred← citeshttps://doi.org/10.1137/19m1291054openalex-snapshot
Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations
inferred← citeshttps://doi.org/10.1137/20m1378223openalex-snapshot
Topology and Adjunction in Promise Constraint Satisfaction
inferred← citeshttps://doi.org/10.1137/23m1604849openalex-snapshot
Forbidden Tournaments and the Orientation Completion Problem
inferred← citeshttps://doi.org/10.1142/s0218196710005911openalex-snapshot
COUNTING THE RELATIONS COMPATIBLE WITH AN ALGEBRA
inferred← citeshttps://doi.org/10.1142/s0218196711006716openalex-snapshot
CLONES OF ALGEBRAS WITH PARALLELOGRAM TERMS
inferred← citeshttps://doi.org/10.1142/s021819671100673xopenalex-snapshot
THE LATTICE OF ALTER EGOS
inferred← citeshttps://doi.org/10.1142/s0218196713500021openalex-snapshot
A GENERAL DUALITY THEORY FOR CLONES
inferred← citeshttps://doi.org/10.1142/s0218196718400106openalex-snapshot
Action of endomorphism semigroups on definable sets
inferred← citeshttps://doi.org/10.1142/s0218196722500096openalex-snapshot
The lattice and semigroup structure of multipermutations
inferred← citeshttps://doi.org/10.1142/s0218196723500327openalex-snapshot
The lattice of clones of self-dual operations collapsed
inferred← citeshttps://doi.org/10.1142/s0218196726500013openalex-snapshot
Network satisfaction problems solved by k -consistency
inferred← citeshttps://doi.org/10.1145/1189056.1189076openalex-snapshot
A rendezvous of logic, complexity, and algebra
inferred← citeshttps://doi.org/10.1145/1374376.1374382openalex-snapshot
The complexity of temporal constraint satisfaction problems
inferred← citeshttps://doi.org/10.1145/1592451.1592453openalex-snapshot
A rendezvous of logic, complexity, and algebra
inferred← citeshttps://doi.org/10.1145/1667053.1667058openalex-snapshot
The complexity of temporal constraint satisfaction problems
inferred← citeshttps://doi.org/10.1145/1805950.1805954openalex-snapshot
Nonuniform Boolean constraint satisfaction problems with cardinality constraint
inferred← citeshttps://doi.org/10.1145/2540090openalex-snapshot
Robust Satisfiability for CSPs
inferred← citeshttps://doi.org/10.1145/2629421openalex-snapshot
Complexity Classifications for Logic-Based Argumentation
inferred← citeshttps://doi.org/10.1145/2677161.2677165openalex-snapshot
Constraint satisfaction problem and universal algebra
inferred← citeshttps://doi.org/10.1145/2898438openalex-snapshot
A Galois Connection for Weighted (Relational) Clones of Infinite Size
inferred← citeshttps://doi.org/10.1145/2933575.2934510openalex-snapshot
Weak consistency notions for all the CSPs of bounded width
inferred← citeshttps://doi.org/10.1145/2933575.2934544openalex-snapshot
The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1145/3007899openalex-snapshot
Quantified Constraint Satisfaction Problem on Semicomplete Digraphs
inferred← citeshttps://doi.org/10.1145/3105907openalex-snapshot
The Complexity of Phylogeny Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1145/3154832openalex-snapshot
Discrete Temporal Constraint Satisfaction Problems
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/3434387openalex-snapshot
Fine-Grained Time Complexity of Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1145/3457606openalex-snapshot
Algebraic Approach to Promise Constraint Satisfaction
inferred← citeshttps://doi.org/10.1145/380752.380868openalex-snapshot
The complexity of maximal constraint languages
inferred← citeshttps://doi.org/10.1145/970831.970840openalex-snapshot
SIGACT news complexity theory column 43
inferred← citeshttps://doi.org/10.1515/dma-2016-0020openalex-snapshot
Galois theory for clones and superclones
inferred← citeshttps://doi.org/10.17654/ms100030427openalex-snapshot
A GALOIS CONNECTION OF ALGEBRAIC RELATIONS AND COLORED RESETS
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.2298/ns20090522pechopenalex-snapshot
Local methods for relational structures and their weak Krasneralgebras
inferred← citeshttps://doi.org/10.2307/2275875openalex-snapshot
The syntax and semantics of entailment in duality theory
inferred← citeshttps://doi.org/10.23638/lmcs-14(2:3)2018openalex-snapshot
$n$-permutability and linear Datalog implies symmetric Datalog
inferred← citeshttps://doi.org/10.3103/s0278641910040047openalex-snapshot
One Approach to synthesizing predicate circuits on the basis of generalized variables
inferred← citeshttps://doi.org/10.3103/s0278641912010049openalex-snapshot
Closed classes containing a homogeneous function class
inferred← citeshttps://doi.org/10.3103/s027864191203003xopenalex-snapshot
On orders of closed classes containing a homogeneous switching function
inferred← citeshttps://doi.org/10.3103/s1066369x11020071openalex-snapshot
The lower neighborhoods problem in a space with closure and a finitary theorem
inferred← citeshttps://doi.org/10.3384/diss.diva-116859openalex-snapshot
On Some Combinatorial Optimization Problems : Algorithms and Complexity
inferred← citeshttps://doi.org/10.3384/diss.diva-122827openalex-snapshot
Strong Partial Clones and the Complexity of Constraint Satisfaction Problems : Limitations and Applications
inferred← citeshttps://doi.org/10.3384/diss.diva-164157openalex-snapshot
Applications of Partial Polymorphisms in (Fine-Grained) Complexity of Constraint Satisfaction Problems
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.cp.2022.11openalex-snapshot
On Redundancy in Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.4230/lipics.esa.2016.18openalex-snapshot
Fixed-Parameter Approximability of Boolean MinCSPs
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2019.36openalex-snapshot
On the Strength of Uniqueness Quantification in Primitive Positive Formulas
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2010.2493openalex-snapshot
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
inferred← citeshttps://doi.org/10.46298/dmtcs.6904openalex-snapshot
Polymorphism-homogeneity and universal algebraic geometry
showing the first 200 of 219 · page through all 219
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.