Fetching the paper…
Reading the bibliography…
A simple way to generate a Boolean function is to take the sign of a real polynomial in $n$ variables.
R. C. Buck, Partition of space,
1943
Earlier work this paper cites.
W. McCulloch, W. Pitts, A logical calculus of the ideas immanent in nervous activity,
1943
Earlier work this paper cites.
P. Erdös, On a lemma of Littlewood and Offord,
1945
Earlier work this paper cites.
L. Schläfli, Gesammelte mathematische Abhandlungen
1950
Earlier work this paper cites.
J. Wendel, A problem in geometric probability,
1962
Earlier work this paper cites.
G.-C. Rota, On the foundations of combinatorial theory. I. Theory of Möbius functions,
1964
Earlier work this paper cites.
T. Cover, Geometrical and statistical properties of systems of linear inequalities with applications in pattern recognition,
1965
Earlier work this paper cites.
P. Erdös, Extremal problems in number theory,
1965
Earlier work this paper cites.
S. Muroga, Lower bounds of the number of threshold functions and a maximum weight,
1965
Earlier work this paper cites.
A. Sárközy, E. Szeméredi, Über ein Problem von Erdös und Moser, Acta Arith. 11 (1965), 205–208
1965
Earlier work this paper cites.
R. O. Winder. Partitions of n-space by hyperplanes,
1966
Earlier work this paper cites.
J. Komlós, On the determinant of ( 0 , 1 ) (0,1) matrices,
1967
Earlier work this paper cites.
J. Komlós, On the determinant of random matrices,
1968
Earlier work this paper cites.
E. Nering, Linear Algebra and Matrix Theory
1970
Earlier work this paper cites.
T. Zaslavsky, Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
1975
Earlier work this paper cites.
G. Halász, Estimates for the concentration function of combinatorial number theory and probability,
1977
Earlier work this paper cites.
P. Baldi, Symmetries and learning in neural network models,
1978
Earlier work this paper cites.
F. Götze, Asymptotic expansions for bivariate von Mises functionals,
1979
Earlier work this paper cites.
J. E. Littlewood, A. C. Offord, On the number of real roots of a random algebraic equation. III,
1982
Earlier work this paper cites.
B. Bollobás, Combinatorics. Set systems, hypergraphs, families of vectors and combinatorial probability
1986
Earlier work this paper cites.
P. McCullagh, Tensor methods in statistics
1987
Earlier work this paper cites.
P. Baldi, Neural networks, orientations of the hypercube, and algebraic threshold functions,
1988
Earlier work this paper cites.
P. Baldi, Group actions and learning for a family of automata,
1988
Earlier work this paper cites.
Deep learning in biomedical data science
P. Baldi · 1988
Earlier work this paper cites.
P. Frankl,Z. Füredi, Solution of the Littlewood-Offord problem in high dimensions,
1988
Earlier work this paper cites.
M. Minsky, S. Papert, Perceptrons: an introduction to computational geometry
1988
Earlier work this paper cites.
A. M. Odlyzko, On subspaces spanned by random selections of ± 1 \pm 1 vectors,
1988
Earlier work this paper cites.
Yu. A. Zuev, Asymptotics of the logarithm of the number of Boolean threshold functions
1989
Earlier work this paper cites.
J. Bruck, Harmonic analysis of polynomial threshold functions,
1990
Earlier work this paper cites.
C. Wang, A. Williams, The threshold order of a boolean function,
1991
Earlier work this paper cites.
Yu. A. Zuev, Combinatorial-probability and geometric methods in threshold logic
1992
Earlier work this paper cites.
R. Beigel, The polynomial method in circuit complexity,
1993
Earlier work this paper cites.
A. A. Irmatov, On the number of threshold functions,
1993
Earlier work this paper cites.
M. Saks, Slicing the hypercube
1993
Earlier work this paper cites.
J. Aspnes, R. Beigel, M. Furst, S. Rudich, The expressive power of voting polynomials,
1994
Earlier work this paper cites.
J. Håstad, On the size of weights for threshold gates,
1994
Earlier work this paper cites.
M. Anthony, Classification by polynomial surfaces,
1995
Cited alongside, same era.
R. Beigel, N. Reingold, D. Spielman, PP is closed under intersection,
1995
Cited alongside, same era.
J. Kahn, J. Komlós, E. Szemerédi, On the probability that a random ± 1 \pm 1 -matrix is singular,
1995
Cited alongside, same era.
M. Talagrand, A new look at independence,
1996
Cited alongside, same era.
N. Alon, V. Vu, Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs,
1997
Cited alongside, same era.
M. Krause, P. Pudlak, Computing boolean functions by polynomials and threshold circuits,
1998
Cited alongside, same era.
J. Bourgain, V. Vu, P. Wood, On the singularity probability of discrete random matrices,
2010
Later among the works it cites.
P. Calka, Tessellations
2010
Later among the works it cites.
R. O’Donnell, R. A. Servedio, New degree bounds for polynomial threshold functions,
2010
Later among the works it cites.
M. Rudelson, R. Vershynin, Non-asymptotic theory of random matrices: extreme singular values
2010
Later among the works it cites.
T. Tao, V. Vu, Random matrices: the distribution of the smallest singular values,
2010
Later among the works it cites.
T. Tao, V. Vu, A sharp inverse Littlewood-Offord theorem,
2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
V. de la Peña, E. Giné, Decoupling: from dependence to independence
1999
Cited alongside, same era.
P. C. Ojha, Enumeration of linear threshold functions from the lattice of hyperplane intersections,
2000
Cited alongside, same era.
M. Anthony, Discrete mathematics of neural networks. Selected topics
2001
Cited alongside, same era.
A. A. Irmatov, Arrangements of hyperplanes and the number of threshold functions,
2001
Cited alongside, same era.
M. Ledoux, The concentration of measure phenomenon
2001
Cited alongside, same era.
T. Zhang, G. Golub, Rank-one approximation to high order tensors,
2001
Cited alongside, same era.
I. Diakonikolas, R. O’Donnell, R. Servedio, Y. Wu, Hardness results for agnostically learning low-degree polynomial threshold functions
2011
Later among the works it cites.
H. Nguyen, V. Vu, Optimal inverse Littlewood-Offord theorems,
2011
Later among the works it cites.
H. Nguyen, On the least singular value of random symmetric matrices,
2012
Later among the works it cites.
H. Nguyen, Inverse Littlewood-Offord problems and the singularity of random symmetric matrices,
2012
Later among the works it cites.
K. Costello, Bilinear and quadratic variants on the Littlewood-Offord problem,
2013
Later among the works it cites.
H. Nguyen, On the singularity of random combinatorial matrices,
2013
Later among the works it cites.
M. Rudelson, R. Vershynin, Hanson-Wright inequality and sub-gaussian concentration,
2013
Later among the works it cites.
I. Diakonikolas, R. A. Servedio, L.-Y. Tan, A. Wan, A regularity lemma and low-weight approximators for low-degree polynomial threshold functions,
2014
Later among the works it cites.
R. O’Donnell, Analysis of Boolean functions
2014
Later among the works it cites.
Y. Plan, R. Vershynin, Dimension reduction by random hyperplane tessellations,
2014
Later among the works it cites.
M. Rudelson, R. Vershynin, Invertibility of random matrices: unitary and orthogonal perturbations,
2014
Later among the works it cites.
R. Vershynin, Invertibility of symmetric random matrices,
2014
Later among the works it cites.
E. Abbe, A. Shpilka, and A. Wigderson, Reed–Muller codes for random erasures and errors,
2015
Later among the works it cites.
F. Götze, A. Naumov, A. Tikhomirov, On minimal singular values of random matrices with correlated entries,
2015
Later among the works it cites.
J. Schmidhuber, Deep learning in neural networks: An overview,
2015
Later among the works it cites.
K. Tikhomirov, The limit of the smallest singular value of random matrices with i.i.d. entries,
2015
Later among the works it cites.
J. Alman, T. Chan, R. Williams, Polynomial representations of threshold functions and algorithmic applications,
2016
Later among the works it cites.
R. Meka, O. Nguyen, V. Vu, Anti-concentration for polynomials of independent random variables,
2016
Later among the works it cites.
R. O’Donnell, Y. Zhao, Polynomial bounds for decoupling, with applications,
2016
Later among the works it cites.
M. Rudelson, R. Vershynin, No-gaps delocalization for general random matrices,
2016
Later among the works it cites.
K. Tikhomirov, The smallest singular value of random rectangular matrices with no moment assumptions on entries,
2016
Later among the works it cites.
A. Basak, M. Rudelson, Invertibility of sparse non-Hermitian matrices,
2017
Later among the works it cites.
A. Bhattacharyya, S. Ghoshal, R. Saket, Hardness of learning noisy halfspaces using polynomial thresholds,
2017
Later among the works it cites.
N. Cook, On the singularity of adjacency matrices for random regular digraphs,
2017
Later among the works it cites.
D. Kane, A structure theorem for poorly anticoncentrated polynomials of Gaussians and applications to the study of polynomial threshold functions,
2017
Later among the works it cites.
A. Litvak, A. Lytova, K. Tikhomirov, N. Tomczak-Jaegermann, P. Youssef, Adjacency matrices of random digraphs: singularity and anti-concentration,
2017
Later among the works it cites.
R. Vershynin, High-dimensional probability. An introduction with applications in data science
2017
Later among the works it cites.
Boolean polynomial threshold functions and random tensors
Pierre Baldi and Roman Vershynin · 2018
Closest in time.
On neuronal capacity
P. Baldi and R. Vershynin · 2018
Closest in time.
The capacity of feedforward neural networks
P. Baldi and R. Vershynin · 2018
Closest in time.