Decomposition Complexity

Details Decomposition Complexity Decomposition Complexity

2010-12-03

arxiv.org/abs/1012.1283v1

Computer Science

Formal Languages and Automata Theory

Journ\'ees Automates Cellulaires 2010, Turku : Finland (2010)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Decomposition Complexity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Decomposition Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decomposition Complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-515730