TC0 contains all languages which are decided by boolean circuits with constant depth and polynomial size, cointaining only unbounded-fanin AND gates, OR 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, and multiplying two n-bit numbers.
Vollmer states that the question of whether the last inclusion above is strict is "one of the main open problems in circuit complexity" (ibid.).
We also have that . (Allender 1996, as cited in Burtschick 1999).
Researchers from Rutgers State University report details of new studies and findings in the area of computer science.
May 27, 2010; According to recent research from the United States, "We observe that many important computational problems in NC1 share a simple...