DocumentCode :
2074964
Title :
Multilinear-NC1 ≠ multilinear-NC2
Author :
Raz, Ran
Author_Institution :
Weizmann Inst., Rehovot, Israel
fYear :
2004
fDate :
17-19 Oct. 2004
Firstpage :
344
Lastpage :
351
Abstract :
An arithmetic circuit or formula is multilinear if the polynomial computed at each of its wires is multilinear. We give an explicit example for a polynomial f(x1,..., xn), with coefficients in {0,1}, such that over any field: (1) f can be computed by a polynomial-size multilinear circuit of depth O(log2 n). (2) Any multilinear formula for f is of size nΩ(log n). This gives a super-polynomial gap between multilinear circuit and formula size, and separates multilinear NC1 circuits from multilinear NC2 circuits.
Keywords :
circuit complexity; digital arithmetic; arithmetic circuit; multilinear-NC1; multilinear-NC2; polynomial-size multilinear circuit; super-polynomial gap; Arithmetic; Circuits; Complexity theory; Computer science; Input variables; Polynomials; Tree graphs; Wires;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE Symposium on
ISSN :
0272-5428
Print_ISBN :
0-7695-2228-9
Type :
conf
DOI :
10.1109/FOCS.2004.42
Filename :
1366254
Link To Document :
بازگشت