Deterministic summation modulo \(\mathcal B_{n}\), the semigroup of binary relations on \(0,1, \dots, n-1\)

DOI10.1016/S0304-3975(95)00245-6zbMath0903.68002OpenAlexW2007014944MaRDI QIDQ1392020

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)

Related Items (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

Cites Work

• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• A machine description and the hierarchy of initial Grzegorczyk classes
• Complete sets and the polynomial-time hierarchy
• Nondeterministic stack register machines
• Deterministic summation modulo \(\mathcal B_{n}\), the semigroup of binary relations on \(0,1, \dots, n-1\)
• Classes of Predictably Computable Functions
• Alternation
• Expectations for Inbreeding Depression on Self-Fertilization of Tetraploids
• The bounded arithmetic hierarchy
• Rudimentary Predicates and Relative Computation
• Monadic Elementary Formal Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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