Polymorphism Algebras

Polymorphism Algebras is a mathematical framework in universal algebra that consists of a set equipped with all finitary operations that preserve the relations of a given relational structure, distinguished by their role in characterizing the invariance properties of constraint satisfaction problems.

24

Publications

854

Citations

42

Authors

27

Institutions

Publications per year

2017–2026

1

Variants

Polymorphism ClonesPolymorphism Clones Of A Relational Structure

Authors

42

  1. MB
    Manuel Bodirsky

    Laboratoire d'Informatique de l'École Polytechnique, France

    4 publications · 73 citations

    4

    h-index

  2. RW
    Ross Willard

    University of Waterloo, Canada

    2 publications · 173 citations

    2

    h-index

  3. MV
    Matthew Valeriote

    McMaster University, Canada

    2 publications · 173 citations

    2

    h-index

  4. MH
    Martin Hils

    Centre National de la Recherche Scientifique, France

    2 publications · 48 citations

    2

    h-index

  5. BM
    Barnaby Martin

    Durham University, United Kingdom

    2 publications · 48 citations

    2

    h-index

1–5 of 42

Venues

  1. Theoretical Computer Science

    2 publications · 34 citations

    2

    h-index

  2. arXiv (Cornell University)

    Repository · 2 publications · 23 citations

    2

    h-index

  3. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 2 publications · 25 citations

    2

    h-index

  4. SIAM Journal on Computing

    1 publications · 128 citations

    1

    h-index

  5. Evidence-Based Mental Health

    EBMH · 1 publications · 15 citations

    1

    h-index

1–5