eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2017-03-06
35:1
35:14
10.4230/LIPIcs.STACS.2017.35
article
Circuit Evaluation for Finite Semirings
Ganardi, Moses
Hucke, Danny
König, Daniel
Lohrey, Markus
The circuit evaluation problem for finite semirings is considered, where semirings are not assumed to have an additive or multiplicative identity. The following dichotomy is shown: If a finite semiring R (i) has a solvable multiplicative semigroup and (ii) does not contain a subsemiring with an additive identity 0 and a multiplicative identity 1 != 0, then its circuit evaluation problem is in the complexity class DET (which is contained in NC^2). In all other cases, the circuit evaluation problem is P-complete.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol066-stacs2017/LIPIcs.STACS.2017.35/LIPIcs.STACS.2017.35.pdf
circuit value problem
finite semirings
circuit complexity