Counting modulo finite semigroups
From MaRDI portal
Recommendations
- Rudimentary relations and primitive recursion: A toolbox
- scientific article; zbMATH DE number 704020
- Sur le produit avec compteur modulo un nombre premier
- Deterministic summation modulo \(\mathcal B_{n}\), the semigroup of binary relations on \(0,1, \dots, n-1\)
- The role of rudimentary relations in complexity theory
Cites work
- Deterministic summation modulo \(\mathcal B_{n}\), the semigroup of binary relations on \(0,1, \dots, n-1\)
- scientific article; zbMATH DE number 4033719 (Why is no real title available?)
- scientific article; zbMATH DE number 774488 (Why is no real title available?)
- scientific article; zbMATH DE number 781164 (Why is no real title available?)
- Nondeterministic stack register machines
- Rudimentary relations and primitive recursion: A toolbox
- Theory of Formal Systems. (AM-47)
Cited in
(5)- Deterministic summation modulo \(\mathcal B_{n}\), the semigroup of binary relations on \(0,1, \dots, n-1\)
- The role of rudimentary relations in complexity theory
- Sur le produit avec compteur modulo un nombre premier
- Modular Counting and Substitution of Structures
- Counting classes: Thresholds, parity, mods, and fewness
This page was built for publication: Counting modulo finite semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941256)