Concepedia

Reflexive digraphs with near unanimity polymorphisms

Miklós Maróti, László Zádori

Discrete Mathematics · 2012 · 24 citations · 15 references

DOI

Concepts

References

15

The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

Tomás Feder, Moshe Y. Vardi · SIAM Journal on Computing · 1998 · 1.1K citations

, , +15

Graphs and homomorphisms

Choice Reviews Online · 2005 · 260 citations

A fixed point theorem for finite partially ordered sets

Ivan Rival · Journal of Combinatorial Theory Series A · 1976 · 94 citations

, , +9

Finitely Related Algebras In CongruenceDistributive Varieties Have Near UnanimityTerms

Libor Barto · Canadian Journal of Mathematics · 2011 · 50 citations · Full text

, , +8

Tractability and learnability arising from algebras with few subpowers

Paweł Idziak, Petar Marković, Ralph McKenzie et al. · 2007 · 45 citations

, , +17