On additive complexity of a sequence of matrices
Data Structures and Algorithms
2012-09-11 v1
Abstract
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.
Cite
@article{arxiv.1209.1645,
title = {On additive complexity of a sequence of matrices},
author = {Igor Sergeev},
journal= {arXiv preprint arXiv:1209.1645},
year = {2012}
}
Comments
7 pages, in English; 8 pages, in Russian