1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.CC2013
Separating OR, SUM, and XOR Circuits
Magnus Find, Mika Göös, Matti Järvisalo +3
Given a boolean n by n matrix A we consider arithmetic circuits for computing the transformation x->Ax over different semirings. Namely, we study three circuit models: monotone OR-…
cs.DS2012★ 1 cited
Fast Monotone Summation over Disjoint Sets
Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
We study the problem of computing an ensemble of multiple sums where the summands in each sum are indexed by subsets of size of an -element ground set. More precisely, the t…