Deterministic summation modulo B_n, the semigroup of binary relations on 0,1, , n-1

DOI10.1016/S0304-3975(95)00245-6MaRDI QIDQ1392020zbMATH OpenOpenAlexFDO

Authors W. G. Handley

Publication date 23 July 1998

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(95)00245-6

zbMATH Keywords

deterministic summation

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Recommendations

• Counting modulo finite semigroups
• scientific article; zbMATH DE number 7297830
• On the operations of bounded suffix summation and multiplication
• Unbounded fan-in circuits and associative functions
• Complete semigroups of binary relations.

Cites work

• A machine description and the hierarchy of initial Grzegorczyk classes
• Alternation
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• Classes of Predictably Computable Functions
• Complete sets and the polynomial-time hierarchy
• Deterministic summation modulo \(\mathcal B_{n}\), the semigroup of binary relations on \(0,1, \dots, n-1\)
• Expectations for Inbreeding Depression on Self-Fertilization of Tetraploids
• scientific article; zbMATH DE number 3857078 (Why is no real title available?)
• scientific article; zbMATH DE number 3912375 (Why is no real title available?)
• scientific article; zbMATH DE number 4033719 (Why is no real title available?)
• scientific article; zbMATH DE number 4066875 (Why is no real title available?)
• scientific article; zbMATH DE number 176196 (Why is no real title available?)
• scientific article; zbMATH DE number 3284302 (Why is no real title available?)
• Monadic Elementary Formal Systems
• Nondeterministic stack register machines
• Rudimentary Predicates and Relative Computation
• The bounded arithmetic hierarchy

Cited in

(3)

• Nondeterministic stack register machines
• Deterministic summation modulo \(\mathcal B_{n}\), the semigroup of binary relations on \(0,1, \dots, n-1\)
• Counting modulo finite semigroups

This page was built for publication: Deterministic summation modulo \(\mathcal B_{n}\), the semigroup of binary relations on \(0,1, \dots, n-1\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1392020)