Polynomial threshold functions and Boolean threshold circuits

We initiate a comprehensive study of the complexity of computing Boolean functions by polynomial threshold functions (PTFs) on general Boolean domains (as opposed to domains such as { 0 , 1 } n or { - 1 , 1 } n that enforce multilinearity). A typical example of such a general Boolean domain, for the purpose of our results, is { 1 , 2 } n . We are mainly interested in the length (the number of monomials) of PTFs, with their degree and weight being of secondary interest.First we motivate the study of PTFs over the { 1 , 2 } n domain by showing their close relation to depth two threshold circuits. In particular we show that PTFs of polynomial length and polynomial degree compute exactly the functions computed by polynomial size THR ? MAJ circuits. We note that known lower bounds for THR ? MAJ circuits extend to the likely strictly stronger model of PTFs (with no degree restriction). We also show that a "max-plus" version of PTFs is related to AC 0 ? THR circuits.We exploit this connection to gain a better understanding of threshold circuits. In particular, we show that (super-logarithmic) lower bounds for 3-player randomized communication protocols with unbounded error would yield (super-polynomial) size lower bounds for THR ? THR circuits.Finally, having thus motivated the model, we initiate structural studies of PTFs. These include relationships between weight and degree of PTFs, and a degree lower bound for PTFs of constant length.

[1]  Rocco A. Servedio,et al.  Learning DNF in time 2Õ(n1/3) , 2004, J. Comput. Syst. Sci..

[2]  M. Panella.  Associate Editor of the Journal of Computer and System Sciences , 2014 .

[3]  J. Gathen,et al.  A bound on solutions of linear integer equalities and inequalities , 1978 .

[4]  Satyanarayana V. Lokam,et al.  Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity , 2001, FSTTCS.

[5]  Kristoffer Arnsfelt Hansen,et al.  Some Meet-in-the-Middle Circuit Lower Bounds , 2004, MFCS.

[6]  Alexander A. Razborov,et al.  Majority gates vs. general weighted threshold gates , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[7]  P. Butkovic.  Max-linear Systems: Theory and Algorithms , 2010 .

[8]  Kristoffer Arnsfelt Hansen,et al.  Exact Threshold Circuits , 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.

[9]  Saburo Muroga,et al.  Threshold logic and its applications , 1971 .

[10]  Pavel Pudlák,et al.  Threshold circuits of bounded depth , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[11]  S. Muroga,et al.  Theory of majority decision elements , 1961 .

[12]  Alexander A. Sherstov.  Separating AC0 from depth-2 majority circuits , 2007, STOC '07.

[13]  Avi Wigdersony.  N (log N) Lower Bounds on the Size of Depth 3 Threshold Circuits with and Gates at the Bottom , 1993 .

[14]  Alexander A. Sherstov.  Communication Lower Bounds Using Dual Polynomials , 2008, Bull. EATCS.

[15]  Harry Buhrman,et al.  On Computation and Communication with Small Bias , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[16]  Alexander A. Sherstov.  SeparatingAC0 from Depth-2 Majority Circuits , 2009, SIAM J. Comput..

[17]  Jürgen Forster,et al.  A linear lower bound on the unbounded error probabilistic communication complexity , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[18]  Scott Aaronson,et al.  BQP and the polynomial hierarchy , 2009, STOC '10.

[19]  Janos Simon,et al.  Probabilistic Communication Complexity , 1986, J. Comput. Syst. Sci..

[20]  Alexander A. Razborov,et al.  The Sign-Rank of AC^O , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[21]  Jehoshua Bruck,et al.  Polynomial threshold functions, AC functions and spectrum norms , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[22]  N. Nisan.  The communication complexity of threshold gates , 1993 .

[23]  Pavel Pudlák,et al.  On the computational power of depth 2 circuits with threshold and modulo gates , 1994, STOC '94.

[24]  Rocco A. Servedio,et al.  Learning intersections and thresholds of halfspaces , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[25]  Richard J. Lipton,et al.  Multi-party protocols , 1983, STOC.

[26]  V Podolskii Vladimir,et al.  Polynomial threshold functions and Boolean threshold circuits , 2013 .

[27]  Alexander A. Razborov,et al.  The Sign-Rank of AC0 , 2010, SIAM J. Comput..

[28]  Richard Beigel.  Perceptrons, PP, and the polynomial hierarchy , 2005, computational complexity.

[29]  Richard Beigel,et al.  The polynomial method in circuit complexity , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[30]  Bernd Sturmfels,et al.  Tropical Mathematics , 2004, math/0408099.

[31]  Johan Håstad,et al.  On the power of small-depth threshold circuits , 1991, computational complexity.

[32]  Adam R. Klivans,et al.  Learning DNF in time 2 Õ(n 1/3 ) . , 2001, STOC 2001.

[33]  Mikael Goldmann,et al.  On the Power of a Threshold Gate at the Top , 1997, Inf. Process. Lett..

[34]  Pavel Pudlák,et al.  Computing Boolean functions by polynomials and threshold circuits , 1998, computational complexity.

[35]  Richard J. Lipton,et al.  Polynomials that Sign Represent Parity and Descartes’ Rule of Signs , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[36]  Marvin Minsky,et al.  Perceptrons: An Introduction to Computational Geometry , 1969 .

[37]  M. Saks.  Slicing the hypercube , 1993 .