Abstract
Polynomial threshold gates are basic processing units of an artificial neural network. When the input vectors are binary vectors, these gates correspond to Boolean functions and can be analyzed via their polynomial representations. In practical applications, it is desirable to find a polynomial representation with the smallest number of terms possible, in order to use the least possible number of input lines to the unit under consideration. For this purpose, instead of an exact polynomial representation, usually the sign representation of a Boolean function is considered. The non-uniqueness of the sign representation allows the possibility for using a smaller number of monomials by solving a minimization problem. This minimization problem is combinatorial in nature, and so far the best known deterministic algorithm claims the use of at most 0.75×2n of the 2n total possible monomials. In this paper, the basic methods of representing a Boolean function by polynomials are examined, and an alternative approach to this problem is proposed. It is shown that it is possible to use at most 0.5×2n = 2n − 1 monomials based on the {0, 1} binary inputs by introducing extra variables, and at the same time keeping the degree upper bound at n. An algorithm for further reduction of the number of terms that used in a polynomial representation is provided. Examples show that in certain applications, the improvement achieved by the proposed method over the existing methods is significant.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anthony, M.: Classification by polynomial surfaces. Discrete Appl. Math. 61, 91–103 (1995)
Artin, M.: Algebra. Prentice-Hall, Englewood Cliffs (1991)
Aspnes, J., Beigel, R., Furst, M., Rudich, S.: The expressive power of voting polynomials. Combinatorica 14, 1–14 (1994)
Beigel, R.: Perceptrons, PP, and the Polynomial Hierarchy. Computational Complexity 4, 339–349 (1994)
Bohossian, V., Bruck, J.: Algebraic techniques for constructing minimal weight threshold functions. SIAM J. Discrete Math. 16, 114–126 (electronic) (2002)
Bruck, J.: Harmonic analysis of polynomial threshold functions. SIAM J. Discrete Math. 3, 168–177 (1990)
Emamy-Khansary, M.R., Ziegler, M.: New bounds for hypercube slicing numbers. In: Discrete Mathematics and Theoretical Computer Science Proceedings AA (DM-CCG), pp. 155–164 (2001)
Hassoun, M.H.: Fundamentals of Artificial Neural Networks. MIT Press, Cambridge (1995)
Matulef, K., O’Donnell, R., Rubinfeld, R., Servedio, R.A.: Testing halfspaces. SIAM J. Comput. 39, 2004–2047 (2010)
Nisan, N., Szegedy, M.: On the degree of Boolean functions as real polynomials. Comput. Complexity 4, 301–313 (1994)
O’Donnell, R., Servedio, R.A.: Extremal properties of polynomial threshold functions. J. Comput. System Sci. 74, 298–312 (2008)
Oztop, E.: Sign-representation of Boolean functions using a small number of monomials. Neural Networks 22, 938–948 (2009)
Parnas, M., Ron, D., Samorodnitsky, A.: Testing basic Boolean formulae. SIAM J. Discrete Math. 16, 20–46 (2002)
Rudeanu, S.: Boolean Functions and Equations. North-Holland, Amsterdam (1974)
Saks, M.E.: Slicing the hypercube, Surveys in Combinatorics. London mathematical society lecture note series, vol. 187, pp. 211–255 (1993)
Siu, K.Y., Roychowdhury, V., Kailath, T.: Discrete Neural Computation. Prentice Hall PTR, Englewood Cliffs (1995)
Schmitt, M.: On computing Boolean functions by a spiking neuron. Ann. Math. Artificial Intelligence 24, 181–191 (1998)
Wang, C., Williams, A.C.: The threshold order of a Boolean function. Discrete Appl. Math. 31, 51–69 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zou, Y.M. (2011). Representing Boolean Functions Using Polynomials: More Can Offer Less. In: Liu, D., Zhang, H., Polycarpou, M., Alippi, C., He, H. (eds) Advances in Neural Networks – ISNN 2011. ISNN 2011. Lecture Notes in Computer Science, vol 6677. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21111-9_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-21111-9_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21110-2
Online ISBN: 978-3-642-21111-9
eBook Packages: Computer ScienceComputer Science (R0)