TC0 is a complexity class used in circuit complexity.
It is the first class in the hierarchy of TC classes.
TC0 contains all languages which are decided by Boolean circuits with constant depth and polynomial size, containing only unbounded fan-in AND gates, OR gates, NOT gates, and majority gates.
Equivalently, threshold gates can be used instead of majority gates.
TC0 contains several important problems, such as sorting n n-bit numbers, multiplying two n-bit numbers, integer division[1] or recognizing the Dyck language with two types of parentheses.
We can relate TC0 to other circuit classes, including AC0 and NC1; Vollmer 1999 p. 126 states:
{\displaystyle {\mathsf {AC}}^{0}\subsetneq {\mathsf {AC}}^{0}[p]\subsetneq {\mathsf {TC}}^{0}\subseteq {\mathsf {NC}}^{1}.}
Vollmer states that the question of whether the last inclusion above is strict is "one of the main open problems in circuit complexity" (ibid.).
{\displaystyle {\mathsf {TC}}^{0}\subsetneq {\mathsf {PP}}}
(Allender 1996, as cited in Burtschick 1999).
The functional version of the uniform
coincides with the closure with respect to composition of the projections and one of the following function sets
log
log
By functional version one means the set of all functions
over non-negative integers that are bounded by functions of FP and
-th bit of
{\displaystyle (y{\text{-th bit of }}f(x_{1},\ldots ,x_{n}))}
{\displaystyle {\mbox{TC}}^{0}}