| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10332693 | Journal of Computer and System Sciences | 2016 | 9 Pages |
Abstract
Given a boolean nÃn matrix A we consider arithmetic circuits for computing the transformation xâ¦Ax over different semirings. Namely, we study three circuit models: monotone OR-circuits, monotone SUM-circuits (addition of non-negative integers), and non-monotone XOR-circuits (addition modulo 2). Our focus is on separating OR-circuits from the two other models in terms of circuit complexity:
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Magnus Find, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen,