Advertisement

New Upper Bounds on the Average PTF Density of Boolean Functions

  • Kazuyuki Amano
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6506)

Abstract

A Boolean function f:{1, − 1} n →{1, − 1} is said to be sign-represented by a real polynomial \(p:{\mathbb R}^n \rightarrow {\mathbb R}\) if sgn(p(x)) = f(x) for all x ∈ {1, − 1} n . The PTF density of f is the minimum number of monomials in a polynomial that sign-represents f. It is well known that every n-variable Boolean function has PTF density at most 2 n . However, in general, less monomials are enough. In this paper, we present a method that reduces the problem of upper bounding the average PTF density of n-variable Boolean functions to the computation of (some modified version of) average PTF density of k-variable Boolean functions for small k. By using this method, we show that almost all n-variable Boolean functions have PTF density at most (0.617) 2 n , which is the best upper bound so far.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Amano, K.: Supplemental data of the paper are available at http://www.cs.gunma-u.ac.jp/~amano/poly/index.html
  2. 2.
    Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge (2009)CrossRefzbMATHGoogle Scholar
  3. 3.
    Cover, T.: Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition. IEEE Trans. Electronic Computers EC-14(3), 326–334 (1965)Google Scholar
  4. 4.
    Gotsman, C.: On Boolean Functions, Polynomials and Algebraic Threshold Functions. Tech. Rep. TR-89-18, Department of Computer Science, Hebrew University (1989)Google Scholar
  5. 5.
    Makhorin, A.: The GLPK (GNU Linear Programming Kit) Package, http://www.gnu.org/software/glpk/
  6. 6.
    Minsky, M., Papert, S.: Perceptrons: An Introduction to Computational Geometry. MIT Press, Cambridge (1968)zbMATHGoogle Scholar
  7. 7.
    Wegener, I.: The Complexity of Boolean Functions. Wiley-Teubner Series in Computer Science (1987)Google Scholar
  8. 8.
    O’Donnell, R., Servedio, R.: Extremal Properties of Polynomial Threshold Functions. J. Comput. Syst. Sci. 74(3), 298–312 (2008); Conference Version in Proc. of CCC 2003, pp. 3–12 (2003)Google Scholar
  9. 9.
    O’Donnell, R., Servedio, R.: New Degree Bounds for Polynomial Threshold Functions. In: Proc. of STOC 2003, pp. 325–334 (2003)Google Scholar
  10. 10.
    Oztop, E.: An Upper Bound on the Minimum Number of Monomials Required to Separate Dichotomies of { − 1, 1}n. Neural Computation 18(12), 3119–3138 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Oztop, E.: Sign-representation of Boolean Functions using a Small Number of Monomials. Neural Networks 22(7), 938–948 (2009)CrossRefzbMATHGoogle Scholar
  12. 12.
    Saks, M.E.: Slicing the Hypercubes. Surveys in Combinatorics, pp. 211–255. Cambridge University Press, Cambridge (1993)Google Scholar
  13. 13.
    Sherstov, A.A.: The Intersection of Two Halfspaces has High Threshold Degree. In: Proc. of FOCS 2009, pp. 343–362 (2009)Google Scholar
  14. 14.
    Sherstov, A.A.: Optimal Bounds for Sign-representing the Intersection of Two Halfspaces by Polynomials. In: Proc. of STOC 2010, pp. 523–532 (2010)Google Scholar
  15. 15.
    The On-Line Encyclopedia of Integer Sequences (2010), Published electronically at http://oeis.org

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Kazuyuki Amano
    • 1
  1. 1.Dept of Comp SciGunma UnivGunmaJapan

Personalised recommendations