On the public citation graph

Polynomial interpolation and the Chinese Remainder Theorem for algebraic systems

0 signed · 233 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/bf01110505openalex-snapshot
Die primitiven Klassen arithmetischer Ringe
inferredcites →https://doi.org/10.1007/bf01113481openalex-snapshot
Produkte von Kongruenzklassengeometrien universeller Algebren
inferredcites →https://doi.org/10.1007/bf01180631openalex-snapshot
The identities of ? and unique subdirect factorization within ? classes of universal algebras
inferredcites →https://doi.org/10.1007/bf01186622openalex-snapshot
The generalized Chinese remainder theorem for universal algebras; subdirect factorization
inferredcites →https://doi.org/10.1007/bf02945027openalex-snapshot
Completeness in arithmetical algebras
inferredcites →https://doi.org/10.1007/bf02945126openalex-snapshot
A Mal’cev condition for admissible relations
inferredcites →https://doi.org/10.1007/bf02945141openalex-snapshot
Characterizing Mal’cev conditions
inferredcites →https://doi.org/10.1007/bfb0060213openalex-snapshot
Kongruenzklassengeometrien
inferredcites →https://doi.org/10.1016/s0021-9800(70)80086-2openalex-snapshot
Two Mal'cev-type theorems in universal algebra
inferredcites →https://doi.org/10.1017/s0305004100011464openalex-snapshot
On the combination of subalgebras
inferredcites →https://doi.org/10.1090/s0002-9904-1926-04156-2openalex-snapshot
The Colloquium publications
inferredcites →https://doi.org/10.1090/s0002-9939-1963-0146104-xopenalex-snapshot
Distributivity and Permutability of Congruence Relations in Equational Classes of Algebras
inferredcites →https://doi.org/10.2140/pjm.1973.49.59openalex-snapshot
A nonassociative extension of the class of distributive lattices
inferredcites →https://doi.org/10.2307/1968883openalex-snapshot
Free Lattices II
inferredcites →https://doi.org/10.2307/2309950openalex-snapshot
Commutative Algebra Vol I.
inferredcites →https://doi.org/10.2307/2318190openalex-snapshot
Lattice Theory: First Concepts and Distributive Lattices.
inferredcites →https://doi.org/10.7146/math.scand.a-10850openalex-snapshot
Algebras Whose Congruence Lattices are Distributive.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/dac.2536openalex-snapshot
An improved t‐out‐of‐n e‐lottery protocol
inferred← citeshttps://doi.org/10.1002/malq.19840302607openalex-snapshot
ALGEBRAISCHE CHARAKTERISIERUNGEN PRÄPRIMALER ALGEBREN
inferred← citeshttps://doi.org/10.1002/malq.19870330109openalex-snapshot
Squares of Primal Algebras
inferred← citeshttps://doi.org/10.1002/malq.19880340210openalex-snapshot
Algebraische Eigenschaften Eines Funktional Unvollständigen Dreiwertigen Aussagenkalküls
inferred← citeshttps://doi.org/10.1007/3-540-49097-3_6openalex-snapshot
Learnability of Quantified Formulas
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_6openalex-snapshot
Galois Connections and Polynomial Completeness
inferred← citeshttps://doi.org/10.1007/978-1-4020-1898-5_8openalex-snapshot
A Survey of Clones Closed Under Conjugation
inferred← citeshttps://doi.org/10.1007/978-3-030-19494-9_23openalex-snapshot
Aggregation via Clone Theory Approach
inferred← citeshttps://doi.org/10.1007/978-3-030-80223-3_14openalex-snapshot
MCP: Capturing Big Data by Satisfiability (Tool Description)
inferred← citeshttps://doi.org/10.1007/978-3-031-21700-5_6openalex-snapshot
Mutual Generation of the Choice and Majority Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-30139-6_18openalex-snapshot
As Close as It Gets
inferred← citeshttps://doi.org/10.1007/978-3-319-31323-8_11openalex-snapshot
Affine Complete Algebras
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_17openalex-snapshot
Qualitative Temporal and Spatial Reasoning Revisited
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-662-48971-0_56openalex-snapshot
Give Me Another One!
inferred← citeshttps://doi.org/10.1007/978-94-009-7798-3_2openalex-snapshot
Exponentiation and Duality
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/978-94-017-0697-1_10openalex-snapshot
Hyperidentities
inferred← citeshttps://doi.org/10.1007/978-94-017-0697-1_2openalex-snapshot
Duality Theory on Ten Dollars a Day
inferred← citeshttps://doi.org/10.1007/978-94-017-0697-1_8openalex-snapshot
Functional and Affine Completeness and Arithmetical Varieties
inferred← citeshttps://doi.org/10.1007/978-981-96-0692-4_17openalex-snapshot
Efficient Implementation of 2SAT Formula Learning over Finite Totally Ordered Domains
inferred← citeshttps://doi.org/10.1007/bf00341639openalex-snapshot
Algebraic properties of crowns and fences
inferred← citeshttps://doi.org/10.1007/bf00383763openalex-snapshot
Monotone clones and the varieties they determine
inferred← citeshttps://doi.org/10.1007/bf00400284openalex-snapshot
A maximal clone of monotone operations which is not finitely generated
inferred← citeshttps://doi.org/10.1007/bf00400285openalex-snapshot
On algebraic properties of monotone clones
inferred← citeshttps://doi.org/10.1007/bf00418652openalex-snapshot
Clones, order varieties, near unanimity functions and holes
inferred← citeshttps://doi.org/10.1007/bf01099284openalex-snapshot
Universal algebras
inferred← citeshttps://doi.org/10.1007/bf01110547openalex-snapshot
Strictly locally order affine complete lattices
inferred← citeshttps://doi.org/10.1007/bf01182451openalex-snapshot
Intersections of finitely generated clones
inferred← citeshttps://doi.org/10.1007/bf01188385openalex-snapshot
Affine complete varieties
inferred← citeshttps://doi.org/10.1007/bf01190710openalex-snapshot
Near unanimity: an obstacle to general duality theory
inferred← citeshttps://doi.org/10.1007/bf01190934openalex-snapshot
Monotone J�nsson operations and near unanimity functions
inferred← citeshttps://doi.org/10.1007/bf01191790openalex-snapshot
Polynomial functions of correlation lattices
inferred← citeshttps://doi.org/10.1007/bf01194536openalex-snapshot
Nondefinability of projectivity in lattice varieties
inferred← citeshttps://doi.org/10.1007/bf01195860openalex-snapshot
From the subalgebras of the square to the discriminator
inferred← citeshttps://doi.org/10.1007/bf01196088openalex-snapshot
The number of varieties of pure majority algebras
inferred← citeshttps://doi.org/10.1007/bf01196547openalex-snapshot
Diagonal subalgebras and local polynomial functions of median algebras
inferred← citeshttps://doi.org/10.1007/bf01204786openalex-snapshot
On the centralizer of the join operation of a finite lattice
inferred← citeshttps://doi.org/10.1007/bf01214082openalex-snapshot
Polynomial interpolation for locally equational classes
inferred← citeshttps://doi.org/10.1007/bf01214209openalex-snapshot
�ber endliche, ordnungsaffinvollst�ndige Verb�nde
inferred← citeshttps://doi.org/10.1007/bf01221790openalex-snapshot
Bjarni J�nsson's contributions in algebra
inferred← citeshttps://doi.org/10.1007/bf01243596openalex-snapshot
Morita equivalence of quasi-primal algebras and sheaves
inferred← citeshttps://doi.org/10.1007/bf01243874openalex-snapshot
Finitely generated clones of terms
inferred← citeshttps://doi.org/10.1007/bf01895654openalex-snapshot
Über kompatible Funktionen in universalen Algebren
inferred← citeshttps://doi.org/10.1007/bf01917539openalex-snapshot
A representation theory for the variety generated by the triangle
inferred← citeshttps://doi.org/10.1007/bf01979700openalex-snapshot
Existence of finite bases in closed classes of Boolean functions
inferred← citeshttps://doi.org/10.1007/bf02133176openalex-snapshot
Congruence-distributive varieties of algebras
inferred← citeshttps://doi.org/10.1007/bf02355411openalex-snapshot
Clone classification of dually discriminator algebras with finite support
inferred← citeshttps://doi.org/10.1007/bf02483911openalex-snapshot
Exponents of lattice-ordered algebras
inferred← citeshttps://doi.org/10.1007/bf02485367openalex-snapshot
Near unanimity identities and congruence distributivity in equational classes
inferred← citeshttps://doi.org/10.1007/bf02485443openalex-snapshot
On the existence of subalgebras of direct products with prescribedd-fold projections
inferred← citeshttps://doi.org/10.1007/bf02488017openalex-snapshot
Characterizations of arithmetical varieties
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-1928-yopenalex-snapshot
Approximate distributive laws and finite equational bases for finite algebras in congruence-distributive varieties
inferred← citeshttps://doi.org/10.1007/s00012-011-0117-4openalex-snapshot
On the generation of clones containing near-unanimity operations
inferred← citeshttps://doi.org/10.1007/s00012-012-0170-7openalex-snapshot
Compatible relations on Heyting chains
inferred← citeshttps://doi.org/10.1007/s00012-012-0183-2openalex-snapshot
Binary central relations and submaximal clones determined by nontrivial equivalence relations
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-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-0291-2openalex-snapshot
The generation of clones with majority operations
inferred← citeshttps://doi.org/10.1007/s00012-014-0310-3openalex-snapshot
On polymorphism-homogeneous relational structures and their clones
inferred← citeshttps://doi.org/10.1007/s00012-015-0333-4openalex-snapshot
A juggler’s dozen of easy† problems
inferred← citeshttps://doi.org/10.1007/s00012-015-0334-3openalex-snapshot
Counting relations on Ockham algebras
inferred← citeshttps://doi.org/10.1007/s00012-016-0384-1openalex-snapshot
Semantical conditions for the definability of functions and relations
inferred← citeshttps://doi.org/10.1007/s00012-016-0393-0openalex-snapshot
Preserving near unanimity terms under products
inferred← citeshttps://doi.org/10.1007/s00012-018-0504-1openalex-snapshot
Polymorphism clones of homogeneous structures: gate coverings and automatic homeomorphicity
inferred← citeshttps://doi.org/10.1007/s00012-018-0556-2openalex-snapshot
Infinitary Baker–Pixley theorem
inferred← citeshttps://doi.org/10.1007/s00012-019-0607-3openalex-snapshot
Term operations in $$\mathcal {V}(N_5)$$
inferred← citeshttps://doi.org/10.1007/s00012-019-0629-xopenalex-snapshot
On the number of clonoids
inferred← citeshttps://doi.org/10.1007/s00012-019-0636-yopenalex-snapshot
Random models of idempotent linear Maltsev conditions. I. Idemprimality
inferred← citeshttps://doi.org/10.1007/s00012-019-0638-9openalex-snapshot
A clonoid based approach to some finiteness results in universal algebraic geometry
inferred← citeshttps://doi.org/10.1007/s00012-021-00726-5openalex-snapshot
De Morgan clones and four-valued logics
inferred← citeshttps://doi.org/10.1007/s00012-021-00762-1openalex-snapshot
Mitschke’s theorem is sharp
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/s00012-024-00874-4openalex-snapshot
Graphs of finite algebras: maximality, rectangularity, and decomposition
inferred← citeshttps://doi.org/10.1007/s00012-025-00891-xopenalex-snapshot
Congruence systems in dual discriminator varieties
inferred← citeshttps://doi.org/10.1007/s00012-025-00893-9openalex-snapshot
Infinitary primitive positive definability over the real numbers with convex relations
inferred← citeshttps://doi.org/10.1007/s000120050040openalex-snapshot
Most algebras have the interpolation property
inferred← citeshttps://doi.org/10.1007/s000120050087openalex-snapshot
Categorical equivalence of algebras with a majority term
inferred← citeshttps://doi.org/10.1007/s000120050095openalex-snapshot
Maximal partial clones with no finite basis
inferred← citeshttps://doi.org/10.1007/s00224-011-9320-0openalex-snapshot
Trichotomies in the Complexity of Minimal Inference
inferred← citeshttps://doi.org/10.1007/s00224-018-9896-8openalex-snapshot
Minimal Distance of Propositional Models
inferred← citeshttps://doi.org/10.1007/s00233-011-9313-yopenalex-snapshot
Finite degree: algebras in general and semigroups in particular
inferred← citeshttps://doi.org/10.1007/s00233-012-9455-6openalex-snapshot
On finitely related semigroups
inferred← citeshttps://doi.org/10.1007/s00605-009-0120-4openalex-snapshot
Polynomial functions on subdirect products
inferred← citeshttps://doi.org/10.1007/s10474-018-0862-3openalex-snapshot
Algebraic functions on a three-element lattice
inferred← citeshttps://doi.org/10.1007/s10485-019-09571-zopenalex-snapshot
Characterizations of Majority Categories
inferred← citeshttps://doi.org/10.1007/s10958-026-08252-2openalex-snapshot
REES CONGRUENCE ALGEBRAS IN CLASSES OF UNARS AND ALGEBRAS WITH OPERATORS
inferred← citeshttps://doi.org/10.1007/s11083-021-09571-6openalex-snapshot
Critical Relations of Crowns in Critical Times of Coronavirus Depression
inferred← citeshttps://doi.org/10.1007/s11225-017-9713-4openalex-snapshot
Restricted Priestley Dualities and Discriminator Varieties
inferred← citeshttps://doi.org/10.1016/0012-365x(92)00527-xopenalex-snapshot
General metrics and contracting operations
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90507-popenalex-snapshot
Partition-induced natural dualities for varieties of pseudo- complemented distributive lattices
inferred← citeshttps://doi.org/10.1016/0022-4049(95)00041-0openalex-snapshot
Morita equivalence of almost-primal clones
inferred← citeshttps://doi.org/10.1016/0024-3795(89)90488-6openalex-snapshot
Representation of general and polyhedral subsemilattices and sublattices of product spaces
inferred← citeshttps://doi.org/10.1016/b978-0-444-87759-8.50010-9openalex-snapshot
PIGGYBACK DUALITIES
inferred← citeshttps://doi.org/10.1016/b978-0-444-87759-8.50012-2openalex-snapshot
TOLERANCE-FREE ALGEBRAS HAVING MAJORITY TERM FUNCTIONS AND ADMITTING NO PROPER SUBALGEBRAS
inferred← citeshttps://doi.org/10.1016/j.disc.2008.01.003openalex-snapshot
Equivalence of operations with respect to discriminator clones
inferred← citeshttps://doi.org/10.1016/j.entcs.2014.02.005openalex-snapshot
Dualizing Clones as Models of Lawvere Theories
inferred← citeshttps://doi.org/10.1016/j.entcs.2014.02.006openalex-snapshot
A Short Introduction to Clones
inferred← citeshttps://doi.org/10.1016/j.ins.2015.09.038openalex-snapshot
On the clone of aggregation functions on bounded lattices
inferred← citeshttps://doi.org/10.1016/j.ins.2021.02.070openalex-snapshot
On the minimality of some generating sets of the aggregation clone on a finite chain
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.04.011openalex-snapshot
A polynomial-time algorithm for near-unanimity graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2018.03.003openalex-snapshot
Towards a characterization of constant-factor approximable finite-valued CSPs
inferred← citeshttps://doi.org/10.1016/j.jpaa.2023.107525openalex-snapshot
New perspectives on semi-primal varieties
inferred← citeshttps://doi.org/10.1016/j.laa.2005.08.004openalex-snapshot
Bimonotone linear inequalities and sublattices of Rn
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.09.014openalex-snapshot
Finite degree clones are undecidable
inferred← citeshttps://doi.org/10.1016/s0004-3702(98)00022-8openalex-snapshot
Constraints, consistency and closure
inferred← citeshttps://doi.org/10.1016/s0079-8169(08)61359-8openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00353-5openalex-snapshot
Quasi-median graphs from sets of partitions
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73819-2openalex-snapshot
Compatible Orderings and Toleranges of Lattices
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00342-6openalex-snapshot
Learnability of quantified formulas
inferred← citeshttps://doi.org/10.1017/s0004972700009680openalex-snapshot
Piggyback-Dualitäten
inferred← citeshttps://doi.org/10.1017/s0004972700018104openalex-snapshot
Monotone clones, residual smallness and congruence distributivity
inferred← citeshttps://doi.org/10.1017/s1446788700000720openalex-snapshot
Locally finite affine complete varieties
inferred← citeshttps://doi.org/10.1017/s1446788700003384openalex-snapshot
Transferring Optimal Dualities: Theory and Practice
inferred← citeshttps://doi.org/10.1023/a:1018941030227openalex-snapshot
Constraints and universal algebra
inferred← citeshttps://doi.org/10.1080/00927872.2013.763256openalex-snapshot
A Generalized Version of the Baker–Pixley Theorem
inferred← citeshttps://doi.org/10.1080/00927872.2024.2358417openalex-snapshot
Varieties defined by basic equations have the amalgamation property
inferred← citeshttps://doi.org/10.1090/s0002-9947-09-04874-0openalex-snapshot
Varieties with few subalgebras of powers
inferred← citeshttps://doi.org/10.1090/tran/8179openalex-snapshot
𝜔-categorical structures avoiding height 1 identities
inferred← citeshttps://doi.org/10.1093/logcom/exp025openalex-snapshot
Qualitative Temporal and Spatial Reasoning Revisited
inferred← citeshttps://doi.org/10.1109/focs.2016.63openalex-snapshot
Testing Assignments to Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1109/focs.2017.37openalex-snapshot
A Dichotomy Theorem for Nonuniform CSPs
inferred← citeshttps://doi.org/10.1109/ismvl.1994.302185openalex-snapshot
Many-valued generalizations of two finite intervals in Post's lattice
inferred← citeshttps://doi.org/10.1109/ismvl.1997.601377openalex-snapshot
Completeness criteria in set-valued logic under compositions with union and intersection
inferred← citeshttps://doi.org/10.1109/ismvl.1998.679515openalex-snapshot
Generating sets for clones and partial clones
inferred← citeshttps://doi.org/10.1109/ismvl.1999.779699openalex-snapshot
Maximal chains of partial clones containing all idempotent partial functions
inferred← citeshttps://doi.org/10.1109/ismvl.2011.49openalex-snapshot
Invitation to Clone Theory with Partial Clones and Hyperclones
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.47openalex-snapshot
The Cardinality of the Set of All Clones Containing a Given Minimal Clone
inferred← citeshttps://doi.org/10.1109/ismvl.2013.46openalex-snapshot
On the Clones Containing a Near-Unanimity Function
inferred← citeshttps://doi.org/10.1109/lics.2008.14openalex-snapshot
Maltsev + Datalog --≫ Symmetric Datalog
inferred← citeshttps://doi.org/10.1109/lics.2009.14openalex-snapshot
Trichotomy in the Complexity of Minimal Inference
inferred← citeshttps://doi.org/10.1109/lics.2009.38openalex-snapshot
The Complexity of Global Cardinality Constraints
inferred← citeshttps://doi.org/10.1109/lics.2012.24openalex-snapshot
Near Unanimity Constraints Have Bounded Pathwidth Duality
inferred← citeshttps://doi.org/10.1111/sjos.12462openalex-snapshot
Maximum likelihood estimation for totally positive log‐concave densities
inferred← citeshttps://doi.org/10.1134/s0001434609090284openalex-snapshot
Orders of discriminator classes in multivalued logic
inferred← citeshttps://doi.org/10.1134/s199508022101025xopenalex-snapshot
Subdirectly Irreducible Algebras in One Class of Algebras with One Operator and the Main Near-Unanimity Operation
inferred← citeshttps://doi.org/10.1137/0317054openalex-snapshot
Equilibrium Points in Nonzero-Sum n -Person Submodular Games
inferred← citeshttps://doi.org/10.1137/120894312openalex-snapshot
Graphs Admitting $k$-NU Operations. Part 1: The Reflexive Case
inferred← citeshttps://doi.org/10.1137/18m1163932openalex-snapshot
Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs
inferred← citeshttps://doi.org/10.1137/18m121085xopenalex-snapshot
Constant-Query Testability of Assignments to Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1137/23m1556010openalex-snapshot
Ideal Membership Problem for Boolean Minority and Dual Discriminator
inferred← citeshttps://doi.org/10.1137/s0895480103436748openalex-snapshot
Near-Unanimity Functions and Varieties of Reflexive Graphs
inferred← citeshttps://doi.org/10.1142/s0218196706003116openalex-snapshot
TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
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/s0218196712500750openalex-snapshot
THE SUBPOWER MEMBERSHIP PROBLEM FOR MAL'CEV ALGEBRAS
inferred← citeshttps://doi.org/10.1142/s0218196713500355openalex-snapshot
SUBALGEBRAS OF THE SQUARES OF FINITE MINIMAL MAJORITY ALGEBRAS
inferred← citeshttps://doi.org/10.1142/s0218196716500065openalex-snapshot
Maximal n-generated subdirect products
inferred← citeshttps://doi.org/10.1142/s0218196716500430openalex-snapshot
Deciding absorption
inferred← citeshttps://doi.org/10.1142/s0218196718500339openalex-snapshot
Hardness results for the subpower membership problem
inferred← citeshttps://doi.org/10.1142/s0218196719500103openalex-snapshot
Baker–Pixley theorem for algebras in relatively congruence distributive quasivarieties
inferred← citeshttps://doi.org/10.1142/s0218196722500692openalex-snapshot
BL-global representations
inferred← citeshttps://doi.org/10.1142/s0218196723500017openalex-snapshot
Between an n-ary and an n + 1-ary near-unanimity term
inferred← citeshttps://doi.org/10.1142/s0218196723500625openalex-snapshot
A short proof of the Baker–Pixley theorem for classes
inferred← citeshttps://doi.org/10.1142/s021819679900014xopenalex-snapshot
CLONES CONTAINING MAL'TSEV OPERATIONS
inferred← citeshttps://doi.org/10.1142/s1793557122501625openalex-snapshot
Menger systems of idempotent cyclic and weak near-unanimity multiplace functions
inferred← citeshttps://doi.org/10.1145/1389095.1389343openalex-snapshot
Genetic programming for finite algebras
inferred← citeshttps://doi.org/10.1145/1970398.1970400openalex-snapshot
Complexity of conservative constraint satisfaction problems
inferred← citeshttps://doi.org/10.1145/2450142.2450146openalex-snapshot
The complexity of conservative valued CSPs
inferred← citeshttps://doi.org/10.1145/2933575.2933604openalex-snapshot
Graphs of relational structures
inferred← citeshttps://doi.org/10.1145/3301410openalex-snapshot
The Complexity of Minimal Inference Problem for Conservative Constraint Languages
inferred← citeshttps://doi.org/10.1201/9780203748671-11openalex-snapshot
Boolean Universal Algebras
inferred← citeshttps://doi.org/10.1287/opre.26.2.305openalex-snapshot
Minimizing a Submodular Function on a Lattice
inferred← citeshttps://doi.org/10.1515/ms-2024-0022openalex-snapshot
Exact-m-majority terms
inferred← citeshttps://doi.org/10.1556/sscmath.49.2012.4.1218openalex-snapshot
Subalgebras of the squares of weakly diagonal majority algebras
inferred← citeshttps://doi.org/10.17654/ms100030427openalex-snapshot
A GALOIS CONNECTION OF ALGEBRAIC RELATIONS AND COLORED RESETS
inferred← citeshttps://doi.org/10.18642/jantaa_7100121803openalex-snapshot
MEET-REDUCIBLE SUBMAXIMAL CLONES DETERMINED BY NONTRIVIAL EQUIVALENCE RELATIONS
inferred← citeshttps://doi.org/10.21136/cmj.1987.102149openalex-snapshot
Arithmeticity at 0
inferred← citeshttps://doi.org/10.21136/mb.2000.126269openalex-snapshot
Characterizing binary discriminator algebras
inferred← citeshttps://doi.org/10.21146/2074-1472-2021-27-2-66-92openalex-snapshot
О выразительных возможностях максимально паранепротиворечивых и параполных четырехзначных расширений FDE
inferred← citeshttps://doi.org/10.2140/astat.2021.12.125openalex-snapshot
Bimonotone subdivisions of point configurations in the plane
inferred← citeshttps://doi.org/10.2140/pjm.1976.65.525openalex-snapshot
The structure of sublattices of the product of n lattices
inferred← citeshttps://doi.org/10.2168/lmcs-6(4:4)2010openalex-snapshot
The complexity of global cardinality constraints
inferred← citeshttps://doi.org/10.2178/bsl/1146620064openalex-snapshot
2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05
inferred← citeshttps://doi.org/10.2178/jsl/1245158096openalex-snapshot
The existence of a near-unanimity term in a finite algebra is decidable
inferred← citeshttps://doi.org/10.22405/2226-8383-2016-17-4-157-166openalex-snapshot
АЛГЕБРЫ РИСА И КОНГРУЭНЦ-АЛГЕБРЫ РИСА В ОДНОМ КЛАССЕ АЛГЕБР С ОПЕРАТОРОМ И ОСНОВНОЙ ОПЕРАЦИЕЙ ПОЧТИ ЕДИНОГЛАСИЯ
inferred← citeshttps://doi.org/10.22405/2226-8383-2021-22-2-271-287openalex-snapshot
On Rees closure in some classes of algebras with an operator
inferred← citeshttps://doi.org/10.22405/2226-8383-2024-25-1-103-115openalex-snapshot
On congruence lattices of algebras with an operator and the symmetric main operation
inferred← citeshttps://doi.org/10.2307/2274853openalex-snapshot
The structure of algebraically and existentially closed Stone and double Stone algebras
inferred← citeshttps://doi.org/10.2307/2322184openalex-snapshot
A Course in Universal Algebra.
inferred← citeshttps://doi.org/10.23638/dmtcs-21-3-22openalex-snapshot
Efficient enumeration of solutions produced by closure operations
inferred← citeshttps://doi.org/10.23638/lmcs-15(1:11)2019openalex-snapshot
The Subpower Membership Problem for Finite Algebras with Cube Terms
inferred← citeshttps://doi.org/10.2989/16073606.2023.2225227openalex-snapshot
On binary matrix properties
inferred← citeshttps://doi.org/10.3103/s0027132208010075openalex-snapshot
Classes of functions of the k-valued logic monotone with respect to sets of width two
inferred← citeshttps://doi.org/10.3103/s027864191203003xopenalex-snapshot
On orders of closed classes containing a homogeneous switching function
inferred← citeshttps://doi.org/10.3390/min8100443openalex-snapshot
Implicit 3D Modeling of Ore Body from Geological Boreholes Data Using Hermite Radial Basis Functions
inferred← citeshttps://doi.org/10.3934/math.2025457openalex-snapshot
Finitely generated classes of multi-argument logic functions excluding majority and choice functions
inferred← citeshttps://doi.org/10.4153/cjm-2009-023-2openalex-snapshot
A Subalgebra Intersection Property for Congruence Distributive Varieties
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/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.4213/dm1317openalex-snapshot
Замкнутые классы трехзначной логики, содержащие существенно многоместные линейные функции
inferred← citeshttps://doi.org/10.4213/mzm1510openalex-snapshot
Клоновая классификация дуально дискриминаторных алгебр с конечным носителем
inferred← citeshttps://doi.org/10.4213/mzm4433openalex-snapshot
О порядках дискриминаторных классов многозначной логики
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2020.110openalex-snapshot
Sensitive Instances of the Constraint Satisfaction Problem
showing the first 200 of 216 · page through all 216
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.