The following pages link to (Q3208654):
Displaying 49 items.
- Finitely generated equational classes (Q258136) (← links)
- The lattice of quasiorder lattices of algebras on a finite set. (Q271695) (← links)
- 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 clones and superclones (Q314226) (← links)
- On the number of finite algebraic structures (Q466908) (← links)
- Dualizing clones into categories of topological spaces. (Q485103) (← links)
- Boolean max-co-clones (Q494629) (← links)
- Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
- Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms (Q710720) (← links)
- Classification of three-valued logical functions preserving 0 (Q750422) (← links)
- Relational systems with trivial endomorphisms and polymorphisms (Q762526) (← links)
- \(H\)-coloring dichotomy revisited (Q817769) (← 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)
- Maximal partial clones determined by the areflexive relations (Q909690) (← links)
- Computational complexity of auditing finite attributes in statistical databases (Q931731) (← links)
- On Boolean primitive positive clones (Q932583) (← links)
- Structure identification of Boolean relations and plain bases for co-clones (Q955340) (← links)
- A combinatorial constraint satisfaction problem dichotomy classification conjecture (Q1041203) (← links)
- Association schemes of small order (Q1299091) (← links)
- General metrics and contracting operations (Q1331969) (← links)
- The number of orthogonal permutations (Q1345530) (← links)
- Unique inclusions of maximal C-clones in maximal clones (Q1652863) (← links)
- Definability of Boolean function classes by linear equations over \(\mathbf{GF}(2)\) (Q1878398) (← links)
- Completeness for concrete near-rings. (Q1887576) (← links)
- On finitely related semigroups. (Q1955601) (← links)
- Reflections on and of minor-closed classes of multisorted operations (Q1991603) (← links)
- Reflections and powers of multisorted minions (Q1996099) (← links)
- Minimal functions on the random graph (Q2017162) (← links)
- Closed sets of finitary functions between products of finite fields of coprime order (Q2057102) (← links)
- On the number of universal algebraic geometries (Q2108528) (← links)
- The lattice of monomial clones on finite fields (Q2238022) (← links)
- On polymorphism-homogeneous relational structures and their clones. (Q2257979) (← links)
- Partial Sheffer operations (Q2276996) (← links)
- Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin (Q2301362) (← links)
- Minimal distance of propositional models (Q2322705) (← links)
- The number of clones determined by disjunctions of unary relations (Q2322711) (← links)
- What makes propositional abduction tractable (Q2389658) (← links)
- The complexity of soft constraint satisfaction (Q2457608) (← links)
- Combinatorial problems raised from 2-semilattices (Q2496183) (← links)
- Constantive Mal’cev clones on finite sets are finitely related (Q3053497) (← links)
- Maximal and minimal C-monoids (Q3099663) (← links)
- Centralizer clones are preserved by category equivalences (Q3118244) (← links)
- Category Theoretic Understandings of Universal Algebra and its Dual: Monads and Lawvere Theories, Comonads and What? (Q3178270) (← links)
- Quantified Constraints in Twenty Seventeen (Q4993605) (← links)
- Automorphisms and strongly invariant relations (Q6137589) (← links)
