The following pages link to (Q3739181):
Displaying 50 items.
- Clones with nullary operations. (Q280187) (← links)
- Dualizing clones as models of Lawvere theories. (Q280192) (← links)
- A short introduction to clones. (Q280194) (← links)
- Galois theory for semiclones (Q334979) (← links)
- Strong partial clones and the time complexity of SAT problems (Q340559) (← links)
- Meet-irreducible submaximal clones determined by nontrivial equivalence relations (Q382339) (← links)
- Totally symmetric functions are reconstructible from identification minors (Q405190) (← links)
- Clones of topological spaces (Q439313) (← links)
- Dualizing clones into categories of topological spaces. (Q485103) (← links)
- On the clones of nilpotent groups with a verbal subgroup of prime order (Q520032) (← links)
- Transformation monoids with finite monoidal intervals (Q522226) (← links)
- Rigid binary relations on a 4-element domain (Q523155) (← links)
- Quantified constraint satisfaction and the polynomially generated powers property (Q539977) (← links)
- Varieties generated by finite homogeneous algebras (Q690102) (← links)
- On the expression complexity of equivalence and isomorphism of primitive positive formulas (Q692919) (← links)
- Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
- Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms (Q710720) (← links)
- Truncation of unitary operads (Q783203) (← links)
- Comtrans algebras and bilinear forms (Q811602) (← links)
- Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
- The complexity of constraint satisfaction games and QCSP (Q840700) (← links)
- Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
- Modular subalgebra lattices (Q920129) (← links)
- The complexity of equality constraint languages (Q929295) (← links)
- Isomorphism and local isomorphism of clones of spaces (Q946586) (← links)
- Structure identification of Boolean relations and plain bases for co-clones (Q955340) (← links)
- Equivalence of operations with respect to discriminator clones (Q1011699) (← links)
- Maximal infinite-valued constraint languages (Q1014639) (← links)
- A field guide to equational logic (Q1201350) (← links)
- Simple Abelian algebras (Q1208094) (← links)
- Constraints, consistency and closure (Q1274280) (← links)
- On the algebraic structure of combinatorial problems (Q1276253) (← links)
- The equational logic of fixed points (Q1391734) (← links)
- Learnability of quantified formulas. (Q1426470) (← links)
- Circuits and expressions with nonassociative gates (Q1567406) (← links)
- Unique inclusions of maximal C-clones in maximal clones (Q1652863) (← links)
- Finite generating sets for reversible gate sets under general conservation laws (Q1682853) (← links)
- On the local closure of clones on countable sets (Q1686327) (← links)
- The wonderland of reflections (Q1709740) (← links)
- On the Arrow property (Q1775737) (← links)
- A new tractable class of constraint satisfaction problems (Q1776199) (← links)
- Maps between a space and its square (Q1888468) (← links)
- Affine spaces and algebras of subalgebras (Q1905999) (← links)
- Finite sublattices in the lattice of clones (Q1908449) (← links)
- Monoid intervals in lattices of clones (Q1918781) (← links)
- Minimal functions on the random graph (Q2017162) (← links)
- On the complexity of the clone membership problem (Q2048213) (← links)
- Closed sets of finitary functions between products of finite fields of coprime order (Q2057102) (← links)
- Abstract relations between functional clones (Q2066093) (← links)
- Reducibility of \(n\)-ary semigroups: from quasitriviality towards idempotency (Q2118358) (← links)
