pith. sign in

arxiv: 1012.1283 · v1 · pith:POW4NEU3new · submitted 2010-12-03 · 💻 cs.FL · cs.CC· cs.DM

Decomposition Complexity

classification 💻 cs.FL cs.CCcs.DM
keywords complexitydecompositionalgorithmicapplicationsautomatabinarycellularcommunication
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.