{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:07:41Z","timestamp":1725570461307},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175169"},{"type":"electronic","value":"9783642175176"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17517-6_28","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T15:13:41Z","timestamp":1291389221000},"page":"304-315","source":"Crossref","is-referenced-by-count":4,"title":["New Upper Bounds on the Average PTF Density of Boolean Functions"],"prefix":"10.1007","author":[{"given":"Kazuyuki","family":"Amano","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"Amano, K.: Supplemental data of the paper are available at http:\/\/www.cs.gunma-u.ac.jp\/~amano\/poly\/index.html"},{"key":"28_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S. Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge (2009)"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Cover, T.: Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition. IEEE Trans. Electronic Computers EC-14(3), 326\u2013334 (1965)","DOI":"10.1109\/PGEC.1965.264137"},{"key":"28_CR4","unstructured":"Gotsman, C.: On Boolean Functions, Polynomials and Algebraic Threshold Functions. Tech. Rep. TR-89-18, Department of Computer Science, Hebrew University (1989)"},{"key":"28_CR5","unstructured":"Makhorin, A.: The GLPK (GNU Linear Programming Kit) Package, http:\/\/www.gnu.org\/software\/glpk\/"},{"key":"28_CR6","volume-title":"Perceptrons: An Introduction to Computational Geometry","author":"M. Minsky","year":"1968","unstructured":"Minsky, M., Papert, S.: Perceptrons: An Introduction to Computational Geometry. MIT Press, Cambridge (1968)"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Wegener, I.: The Complexity of Boolean Functions. Wiley-Teubner Series in Computer Science (1987)","DOI":"10.1007\/3-540-18170-9_185"},{"key":"#cr-split#-28_CR8.1","doi-asserted-by":"crossref","unstructured":"O???Donnell, R., Servedio, R.: Extremal Properties of Polynomial Threshold Functions. J. Comput. Syst. Sci.??74(3), 298???312 (2008);","DOI":"10.1016\/j.jcss.2007.06.021"},{"key":"#cr-split#-28_CR8.2","unstructured":"Conference Version in Proc. of CCC 2003, pp. 3???12 (2003)"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"O\u2019Donnell, R., Servedio, R.: New Degree Bounds for Polynomial Threshold Functions. In: Proc. of STOC 2003, pp. 325\u2013334 (2003)","DOI":"10.1145\/780591.780592"},{"issue":"12","key":"28_CR10","doi-asserted-by":"publisher","first-page":"3119","DOI":"10.1162\/neco.2006.18.12.3119","volume":"18","author":"E. Oztop","year":"2006","unstructured":"Oztop, E.: An Upper Bound on the Minimum Number of Monomials Required to Separate Dichotomies of {\u2009\u2212\u20091, 1} n . Neural Computation\u00a018(12), 3119\u20133138 (2006)","journal-title":"Neural Computation"},{"issue":"7","key":"28_CR11","doi-asserted-by":"publisher","first-page":"938","DOI":"10.1016\/j.neunet.2009.03.016","volume":"22","author":"E. Oztop","year":"2009","unstructured":"Oztop, E.: Sign-representation of Boolean Functions using a Small Number of Monomials. Neural Networks\u00a022(7), 938\u2013948 (2009)","journal-title":"Neural Networks"},{"key":"28_CR12","first-page":"211","volume-title":"Slicing the Hypercubes. Surveys in Combinatorics","author":"M.E. Saks","year":"1993","unstructured":"Saks, M.E.: Slicing the Hypercubes. Surveys in Combinatorics, pp. 211\u2013255. Cambridge University Press, Cambridge (1993)"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Sherstov, A.A.: The Intersection of Two Halfspaces has High Threshold Degree. In: Proc. of FOCS 2009, pp. 343\u2013362 (2009)","DOI":"10.1109\/FOCS.2009.18"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Sherstov, A.A.: Optimal Bounds for Sign-representing the Intersection of Two Halfspaces by Polynomials. In: Proc. of STOC 2010, pp. 523\u2013532 (2010)","DOI":"10.1145\/1806689.1806762"},{"key":"28_CR15","unstructured":"The On-Line Encyclopedia of Integer Sequences (2010), Published electronically at http:\/\/oeis.org"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17517-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T15:49:35Z","timestamp":1559836175000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17517-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175169","9783642175176"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17517-6_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}