Decomposition Complexity
Formal Languages and Automata Theory
2010-12-07 v1 Computational Complexity
Discrete Mathematics
Abstract
We consider a problem of decomposition of a ternary function into a composition of binary ones from the viewpoint of communication complexity and algorithmic information theory as well as some applications to cellular automata.
Keywords
Cite
@article{arxiv.1012.1283,
title = {Decomposition Complexity},
author = {Alexander Shen},
journal= {arXiv preprint arXiv:1012.1283},
year = {2010}
}
Comments
Journ\'ees Automates Cellulaires 2010, Turku : Finland (2010)