Skip to main content
×
×
Home
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 15
  • Cited by
    This (lowercase (translateProductType product.productType)) has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Kabanets, Valentine Kane, Daniel M. and Lu, Zhenjian 2017. A polynomial restriction lemma with applications. p. 615.

    Sezener, Can Eren and Oztop, Erhan 2017. Artificial Neural Networks and Machine Learning – ICANN 2017. Vol. 10613, Issue. , p. 146.

    Sezener, Can Eren and Oztop, Erhan 2015. Minimal Sign Representation of Boolean Functions: Algorithms and Exact Results for Low Dimensions. Neural Computation, Vol. 27, Issue. 8, p. 1796.

    Podolskii, Vladimir V. 2011. Degree-uniform lower bound on the weights of polynomials with given sign function. Proceedings of the Steklov Institute of Mathematics, Vol. 274, Issue. 1, p. 231.

    Emamy-K, M. R. 2011. A geometric connection to threshold logic via cubical lattices. Annals of Operations Research, Vol. 188, Issue. 1, p. 141.

    Diakonikolas, Ilias Servedio, Rocco A. Tan, Li-Yang and Wan, Andrew 2010. A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold Functions. p. 211.

    Podolskii, V. V. and Sherstov, A. A. 2010. A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length. Mathematical Notes, Vol. 87, Issue. 5-6, p. 860.

    Подольский, Владимир Владимирович Podolskii, Vladimir Vladimirovich Шерстов, Александр Александрович and Sherstov, Aleksander Aleksandrovich 2010. Небольшое уменьшение степени многочлена с заданной знаковой функцией может экспоненциально увеличить его вес и длину. Математические заметки, Vol. 87, Issue. 6, p. 885.

    Sherstov, Alexander A. 2009. The Intersection of Two Halfspaces Has High Threshold Degree. p. 343.

    Sherstov, Alexander A. 2007. Halfspace Matrices. p. 83.

    Klivans, Adam R. and Sherstov, Alexander A. 2007. Unconditional lower bounds for learning intersections of halfspaces. Machine Learning, Vol. 69, Issue. 2-3, p. 97.

    Franco, L. and Anthony, M. 2006. The influence of oppositely classified examples on the generalization complexity of Boolean functions. IEEE Transactions on Neural Networks, Vol. 17, Issue. 3, p. 578.

    Basu, S. Bhatnagar, N. Gopalan, P. and Lipton, R.J. 2004. Polynomials that sign represent parity and descartes rule of signs. p. 223.

    O'Donnell, R. and Servedio, R.A. 2003. Extremal properties of polynomial threshold functions. p. 3.

    Aichholzer, Oswin and Aurenhammer, Franz 1996. Classifying Hyperplanes in Hypercubes. SIAM Journal on Discrete Mathematics, Vol. 9, Issue. 2, p. 225.

    ×
  • Print publication year: 1993
  • Online publication date: March 2010

Slicing the hypercube

Recommend this book

Email your librarian or administrator to recommend adding this book to your organisation's collection.

Surveys in Combinatorics, 1993
  • Online ISBN: 9780511662089
  • Book DOI: https://doi.org/10.1017/CBO9780511662089
Please enter your name
Please enter a valid email address
Who would you like to send this to *
×