2000 character limit reached
Decomposition Complexity (1012.1283v1)
Published 3 Dec 2010 in cs.FL, cs.CC, and cs.DM
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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.