On additive complexity of a sequence of matrices
We show new upper and lower bounds for the complexity of implementation of a sequence of Boolean matrices proposed by Kaski et al. (arXiv:1208.0554) with additive circuits.
cs.DS↗
arXiv subjects
Igor Sergeev
Publications and source records attributed to Igor Sergeev.