Fetching the paper…
Reading the bibliography…
Halfspaces or linear threshold functions are widely studied in complexity theory, learning theory and algorithm design.
The elementary statistics of majority voting
L. S.Penrose · 1946
Earlier work this paper cites.
The perceptron: A probabilistic model for information storage and organization in the brain
Frank Rosenblatt · 1958
Earlier work this paper cites.
Collected papers
Józef Marcinkiewicz · 1964
Earlier work this paper cites.
The classical moment problem and some related questions in analysis
N. I. Akhiezer · 1965
Earlier work this paper cites.
Threshold logic: A synthesis approach
Michael L. Dertouzos · 1965
Earlier work this paper cites.
Threshold logic
Szetsen Hu · 1965
Earlier work this paper cites.
Threshold logic
Philip M. Lewis and Clarence Leroy Coates · 1967
Earlier work this paper cites.
A counterexample in weighted majority games
J. R. Isbell · 1969
Earlier work this paper cites.
Threshold logic
Qinglai Sheng · 1969
Earlier work this paper cites.
Threshold logic and its applications
S. Muroga · 1971
Earlier work this paper cites.
The stability of the characterization of the multivariate normal distribution in the Skitovič-Darmois theorem
Ju. R. Gabovič · 1976
Earlier work this paper cites.
Mathematical properties of the banzhaf power index
P. Dubey and L. S. Shapley · 1979
Earlier work this paper cites.
Estimate of the closeness of distributions in terms of identical moments
L. B. Klebanov and S. T. Mkrtčjan · 1980
Earlier work this paper cites.
Averaging sets: a generalization of mean values and spherical designs
P. D. Seymour and Thomas Zaslavsky · 1984
Earlier work this paper cites.
Moments in mathematics
Henry J. Landau, editor · 1987
Earlier work this paper cites.
Hecke operators and distributing points on S 2 S^{2} . II
A. Lubotzky, R. Phillips, and P. Sarnak · 1987
Earlier work this paper cites.
Kolichestvennye kriterii skhodimosti veroyatnostnykh mer
A. V. Kakosyan, L. B. Klebanov, and S. T. Rachev · 1988
Earlier work this paper cites.
Variation ranks of communication matrices and lower bounds for depth two circuits having symmetric gates with unbounded fan-in
Matthias Krause 0001 and Stephan Waack · 1991
Earlier work this paper cites.
Majority gates vs. general weighted threshold gates
Mikael Goldmann, Johan Håstad, and Alexander A. Razborov · 1992
Earlier work this paper cites.
Pseudorandom generators for space-bounded computation
Noam Nisan · 1992
Earlier work this paper cites.
A characterization of weighted voting
A. Taylor and W. Zwicker · 1992
Cited alongside, same era.
Threshold circuits of bounded depth
András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, and György Turán · 1993
Cited alongside, same era.
Pseudorandomness for network algorithms
Russell Impagliazzo, Noam Nisan, and Avi Wigderson · 1994
Cited alongside, same era.
Recherches sur les fractions continues
Thomas Jan Stieltjes · 1995
Cited alongside, same era.
Geometric arguments yield better bounds for threshold circuits and distributed computing
Matthias Krause 0001 · 1996
Cited alongside, same era.
A decision-theoretic generalization of on-line learning and an application to boosting
Yoav Freund and Robert E. Schapire · 1997
Cited alongside, same era.
Bounded independence fools halfspaces
Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, and Emanuele Viola · 2010
Later among the works it cites.
Bounded independence fools degree-2 threshold functions
Ilias Diakonikolas, Daniel M. Kane, and Jelani Nelson · 2010
Later among the works it cites.
k-independent gaussians fool polynomial threshold functions
Daniel M. Kane · 2011
Later among the works it cites.
A small prg for polynomial threshold functions of gaussians
Daniel M. Kane · 2011
Later among the works it cites.
Almost optimal explicit Johnson-Lindenstrauss families
Daniel M. Kane Raghu Meka and Jelani Nelson · 2011
Later among the works it cites.
Lectures on geometric functional analysis
Roman Vershynin · 2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Simulating threshold circuits by majority circuits
Mikael Goldmann and Marek Karpinski · 1998
Cited alongside, same era.
Statistical Learning Theory
V. Vapnik · 1998
Cited alongside, same era.
The discrepancy method: randomness and complexity
Bernard Chazelle · 2000
Cited alongside, same era.
Relations between communication complexity, linear arrangements, and computational complexity
Jürgen Forster, Matthias Krause 0001, Satyanarayana V. Lokam, Rustam Mubarakzjanov, Niels Schmitt, and Hans-Ulrich Simon · 2001
Cited alongside, same era.
Measure concentration
Alexander Barvinok · 2005
Cited alongside, same era.
The Concentration of Measure Phenomenon
M. Ledoux · 2005
Cited alongside, same era.
A method of moments for mixture models and hidden markov models
Animashree Anandkumar, Daniel Hsu, and Sham M. Kakade · 2012
Later among the works it cites.
Local random quantum circuits are approximate polynomial-designs
F. G. S. L. Brandao, A. W. Harrow, and M. Horodecki · 2012
Later among the works it cites.
A structure theorem for poorly anticoncentrated gaussian chaoses and applications to the study of polynomial threshold functions
Daniel M. Kane · 2012
Later among the works it cites.
Explicit dimension reduction and its applications
Zohar Shay Karnin, Yuval Rabani, and Amir Shpilka · 2012
Later among the works it cites.
Moments and positive polynomials for optimization
Jean B. Lasserre · 2012
Later among the works it cites.
Introduction to the non-asymptotic analysis of random matrices
Roman Vershynin · 2012
Later among the works it cites.
Lie groups
Daniel Bump · 2013
Later among the works it cites.
Balls and bins: Smaller hash families and faster evaluation
L. Elisa Celis, Omer Reingold, Gil Segev, and Udi Wieder · 2013
Later among the works it cites.
Sparse Covers for Sums of Indicators
C. Daskalakis and C. Papadimitriou · 2013
Later among the works it cites.
Learning halfspaces under log-concave densities: Polynomial approximations and moment matching
Daniel M. Kane, Adam Klivans, and Raghu Meka · 2013
Later among the works it cites.
Pseudorandom generators for polynomial threshold functions
Raghu Meka and David Zuckerman · 2013
Later among the works it cites.
Pseudorandom generators for polynomial threshold functions
Raghu Meka and David Zuckerman · 2013
Later among the works it cites.
Pseudorandomness for tail bounds and majorities, 2014
Parikshit Gopalan, Daniel Kane, and Raghu Meka · 2014
Closest in time.
A pseudorandom generator for polynomial threshold functions of gaussian with subpolynomial seed length
Daniel Kane · 2014
Closest in time.