arXiv Open Access 2012

On additive complexity of a sequence of matrices

Igor Sergeev

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.DS

Penulis (1)

Igor Sergeev

Format Sitasi

APA MLA BibTeX

Sergeev, I. (2012). On additive complexity of a sequence of matrices. https://arxiv.org/abs/1209.1645

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2012
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓