The complexity of Boolean functions
The complexity of Boolean functions
Sorting and Searching on the Word RAM
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Bounded-depth circuits: separating wires from gates
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The complexity of word circuits
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
A Communication Approach to the Superposition Problem
Fundamenta Informaticae - Hardest Boolean Functions and O.B. Lupanov
Kolmogorov complexity as a language
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
| Hi-index | 0.00 |
We study the following question, communicated to us by Miklós Ajtai: Can all explicit (e.g., polynomial time computable) functions f: ({0,1} w )3 驴{0,1} w be computed by word circuits of constant size? A word circuit is an acyclic circuit where each wire holds a word (i.e., an element of {0,1} w ) and each gate G computes some binary operation $g_G:(\{0,1\}^w)^2 \rightarrow \{0,1\}^w$, defined for all word lengths w. We present an explicit function so that its w'th slice for any w 驴 8 cannot be computed by word circuits with at most 4 gates. Also, we formally relate Ajtai's question to open problems concerning ACC0 circuits.