Modular Complexity Classes

Modular Complexity Classes is a theoretical framework in computational complexity theory that characterizes complexity classes based on their closure properties under modular counting operations, distinguishing it from other complexity-theoretic frameworks by its emphasis on algebraic structure and residue-based computation.

10

Publications

420

Citations

19

Authors

16

Institutions

Publications per year

2017–2026

2

Authors

19

  1. ÁR
    Álvaro Romero–Jiménez

    Universidad de Sevilla, Spain

    1 publications · 166 citations

    1

    h-index

  2. AH
    Arthur H. Watson

    Marymount University, United States

    1 publications · 13 citations

    1

    h-index

  3. IF
    Issa Feghali

    Marymount University, United States

    1 publications · 13 citations

    1

    h-index

  4. JG
    Janusz Grabowski

    Institute of Mathematics, Poland

    1 publications · 24 citations

    1

    h-index

  5. FW
    Friedrich Wehrung

    Laboratoire de Mathématiques d'Orsay, France

    1 publications · 15 citations

    1

    h-index

1–5 of 19

Venues

  1. Algebra Universalis

    1 publications · 15 citations

    1

    h-index

  2. Automatica

    1 publications · 37 citations

    1

    h-index

  3. Transformation Groups

    1 publications · 24 citations

    1

    h-index

  4. Natural Computing

    1 publications · 166 citations

    1

    h-index

  5. Nature Communications

    1 publications · 103 citations

    1

    h-index

1–5