[Lemma 3.8 and Corollary 3.9 in [1]}] Suppose \(F = (n)\) . The function \(\mathrm {TW}_F: \lbrace 0, \ldots , nF \rbrace  \rightarrow \lbrace 0, \ldots , F-1\rbrace \)  can be implemented using a neural network with \(O(\log n)\)  hidden units and \(O( \log n)\)  depth.
