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
10
1–5 of 10
19
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 19
16
Universität Ulm
Ulm, Germany
1 h-index
1 publications
10 citations
Johannes Gutenberg University Mainz
Mainz, Germany
1 h-index
1 publications
10 citations

University of Duisburg-Essen
Essen, Germany
1 h-index
1 publications
10 citations
George Mason University
Fairfax, United States
1 h-index
1 publications
103 citations
University of Michigan
Ann Arbor, United States
1 h-index
1 publications
37 citations
Marymount University
Arlington, United States
1 h-index
1 publications
13 citations

University of Manitoba
Winnipeg, Canada
1 h-index
1 publications
15 citations

Polish Academy of Sciences
Warsaw, Poland
1 h-index
1 publications
24 citations
1–8 of 16
1 publications · 15 citations
1
h-index
1 publications · 37 citations
1
h-index
1 publications · 24 citations
1
h-index
1 publications · 166 citations
1
h-index
1 publications · 103 citations
1
h-index
1–5