TC (complexity)

In theoretical computer science, and specifically computational complexity theory and circuit complexity, TC (Threshold Circuit) is a complexity class of decision problems that can be recognized by threshold circuits, which are Boolean circuits with AND, OR, and Majority gates, or equivalently, threshold gates. For each fixed i, the complexity class TCⁱ consists of all languages that can be recognized by a family of threshold circuits of depth $O(\log^i n)$ , polynomial size, and unbounded fan-in. The class TC is defined via

: $\mbox{TC} = \bigcup_{i \geq 0} \mbox{TC}^i.$

The class was proposed in 1988 to formalize the computational complexity of artificial neural networks.{{Cite journal |last1=Parberry |first1=Ian |last2=Schnitger |first2=Georg |date=June 1988 |title=Parallel computation with threshold functions |url=https://linkinghub.elsevier.com/retrieve/pii/002200008890030X |journal=Journal of Computer and System Sciences |language=en |volume=36 |issue=3 |pages=278–302 |doi=10.1016/0022-0000(88)90030-X}}

Relation to NC and AC

The relationship between the TC, NC and the AC hierarchy can be summarized as follows:

: $\mbox{NC}^i \subseteq \mbox{AC}^i \subseteq \mbox{TC}^i \subseteq \mbox{NC}^{i+1}.$

In particular, we know that

: $\mbox{NC}^0 \subsetneq \mbox{AC}^0 \subsetneq \mbox{TC}^0 \subseteq \mbox{NC}^{1}.$

The first strict containment follows from the fact that NC⁰ cannot compute any function that depends on all the input bits. Thus choosing a problem that is trivially in AC⁰ and depends on all bits separates the two classes. (For example, consider the OR function.) The strict containment AC⁰ ⊊ TC⁰ follows because parity and majority (which are both in TC⁰) were shown to be not in AC⁰.{{citation | last1 = Furst | first1 = Merrick | last2 = Saxe | first2 = James B. | author2-link = James B. Saxe | last3 = Sipser | first3 = Michael | author3-link = Michael Sipser | doi = 10.1007/BF01744431 | issue = 1 | journal = Mathematical Systems Theory | mr = 738749 | pages = 13–27 | title = Parity, circuits, and the polynomial-time hierarchy | volume = 17 | year = 1984}}.{{Citation | last1=Håstad | first1=Johan | series=Advances in Computing Research | volume=5 | title=Randomness and Computation | editor-first=Silvio | editor-last=Micali | url=http://reference.kfupm.edu.sa/content/a/l/almost_optimal_lower_bounds_for_small_de_134215.pdf | publisher=JAI Press | year=1989 | chapter=Almost Optimal Lower Bounds for Small Depth Circuits | pages=6–20 | isbn=0-89232-896-7 | url-status=dead | archiveurl=https://web.archive.org/web/20120222163102/http://reference.kfupm.edu.sa/content/a/l/almost_optimal_lower_bounds_for_small_de_134215.pdf | archivedate=2012-02-22 }}

As an immediate consequence of the above containments, we have that NC = AC = TC.

References

{{cite book | last = Vollmer | first = Heribert | title = Introduction to Circuit Complexity | year = 1999 | publisher = Springer | location = Berlin | isbn = 3-540-64310-9}}

Category:Circuit complexity

Category:Complexity classes