Content deleted Content added
m →References: +ja |
added "odd" to Smolensky result |
||
Line 16:
===Key results===
*The boolean function PARITY, which is 1 if and only if the sum of its input bits is odd, does not lie in <math>AC^0</math>. The result was first established independently by Ajtai (1983) and by Furst, Saxe and Sipser (1984). Later improvements by Hastad (1987) in fact establish that any family of <math>AC^0</math> computing PARITY requires exponential size. Smolensky (1986) proved that this is true even if the circuit is augmented with gates computing the sum of its input bits modulo some odd prime p.
*The monotone function CLIQUE cannot be computed by a polynomial-size family of monotone circuits (that is, circuits with AND and OR gates but no negation). This original result of [[Alexander Razborov|Razborov]] (1985) was later improved to an exponential-size lower bound by Alon and Boppana (1987). Raz and McKenzie later showed that the monotone NC hierarchy is infinite (1999).
*Division lies in uniform [[TC0]] (Hesse 2001).
| |||