The following pages link to Operations with structures (Q5561941):
Displaying 50 items.
- Algebras in permutable varieties: Geometrical properties of affine algebras (Q599073) (← links)
- Reconcilable differences (Q639856) (← links)
- Containment of conjunctive queries on annotated relations (Q639858) (← links)
- Distinguishing graphs by their left and right homomorphism profiles (Q648964) (← links)
- Finding the prime factors of strong direct product graphs in polynomial time (Q686286) (← links)
- On a multiplicative graph function conjecture (Q786831) (← links)
- In praise of homomorphisms (Q826325) (← links)
- Limits of dense graph sequences (Q859618) (← links)
- A surprising permanence of old motivations (a not-so-rigid story) (Q1045032) (← links)
- Cancellation among finite unary algebras (Q1126198) (← links)
- A characterization of cancellable k-ary structures (Q1217821) (← links)
- The fine spectrum of a variety (Q1229740) (← links)
- Holographic algorithms beyond matchgates (Q1706145) (← links)
- Duality theorems for finite structures (characterising gaps and good characterisations) (Q1850486) (← links)
- Density via duality. (Q1853500) (← links)
- Lattices arising in categorial investigations of Hedetniemi's conjecture (Q1917488) (← links)
- Dichotomy for Holant\(^\ast\) problems on the Boolean domain (Q2032295) (← links)
- Polyadic sets and homomorphism counting (Q2094593) (← links)
- Fractional isomorphism of graphons (Q2095107) (← links)
- Discrete density comonads and graph parameters (Q2104475) (← links)
- Quasi-independence, homology and the unity of type: a topological theory of characters (Q2177083) (← links)
- The isomorphism problem for group algebras: a criterion (Q2182109) (← links)
- Graph exponentiation and neighborhood reconstruction (Q2214326) (← links)
- A method for obtaining refinement theorems, with an application to direct products of semigroups (Q2264784) (← links)
- Powers of ordered sets (Q2266033) (← links)
- Strengthening topological colorful results for graphs (Q2359976) (← links)
- Double graphs (Q2468004) (← links)
- The rank of connection matrices and the dimension of graph algebras (Q2493113) (← links)
- On the cancellation law among finite relational structures (Q2547900) (← links)
- Categorial quasivarieties (Q2559368) (← links)
- Chromatic numbers and products (Q2570106) (← links)
- Unique list-colourability and the fixing chromatic number of graphs (Q2576344) (← links)
- A dichotomy for bounded degree graph homomorphisms with nonnegative weights (Q2678252) (← links)
- Approximately Counting $H$-Colorings is $\#\mathrm{BIS}$-Hard (Q2810271) (← links)
- A Complete Dichotomy Rises from the Capture of Vanishing Signatures (Q2817798) (← links)
- The complexity of counting homomorphisms to cactus graphs modulo 2 (Q2828223) (← links)
- Counting Homomorphisms to Sparse Graphs (Q2851494) (← links)
- Many Facets of Dualities (Q2971613) (← links)
- Progress in Complexity of Counting Problems (Q3004647) (← links)
- On recognizing graphs by numbers of homomorphisms (Q3057061) (← links)
- The structure of locally finite varieties with polynomially many models (Q3079193) (← links)
- Nonnegative Weighted #CSP: An Effective Complexity Dichotomy (Q3179267) (← links)
- (Q3360922) (← links)
- Approximately Counting H-Colourings is $$\#\mathrm {BIS}$$-Hard (Q3448813) (← links)
- Counting Homomorphisms to Square-Free Graphs, Modulo 2 (Q3448822) (← links)
- Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings (Q3466338) (← links)
- The contributions of Alfred Tarski to general algebra (Q3770483) (← links)
- The Complexity of Boolean Holant Problems with Nonnegative Weights (Q4571918) (← links)
- Constructing cospectral graphs via a new form of graph product (Q4580053) (← links)
- (Q4680245) (← links)
