, Volume 17, Issue 1, pp 13-27

Parity, circuits, and the polynomial-time hierarchy

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


A super-polynomial lower bound is given for the size of circuits of fixed depth computing the parity function. Introducing the notion of polynomial-size, constant-depth reduction, similar results are shown for the majority, multiplication, and transitive closure functions. Connections are given to the theory of programmable logic arrays and to the relativization of the polynomial-time hierarchy.