Journal of Computer and System Sciences ( IF 1.1 ) Pub Date : 2016-03-10 , DOI: 10.1016/j.jcss.2016.01.001 Magnus Find 1 , Mika Göös 2, 3 , Matti Järvisalo 3 , Petteri Kaski 4 , Mikko Koivisto 3 , Janne H Korhonen 3
Given a boolean matrix A we consider arithmetic circuits for computing the transformation 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:
- (1)
We show how to obtain matrices that admit OR-circuits of size , but require SUM-circuits of size .
- (2)
We consider the task of rewriting a given OR-circuit as a XOR-circuit and prove that any subquadratic-time algorithm for this task violates the strong exponential time hypothesis.
中文翻译:
分离“或”,“求和”和“异或”电路。
给定一个布尔值 矩阵A我们考虑算术电路来计算变换在不同的半环上。即,我们研究了三种电路模型:单调或电路,单调SUM电路(非负整数的加法)和非单调XOR电路(模2的加法)。我们的重点是按照电路复杂度将“或”电路与其他两个模型分开:
- (1)
我们展示了如何获得允许大小为OR的矩阵 ,但需要SUM电路的大小 。
- (2)
我们考虑将给定的OR电路重写为XOR电路的任务,并证明该任务的任何二次时间算法都违反了强大的指数时间假设。