@article{bc6f3f57c0834b00ac8fef37e9f3745e,

title = "Self-predicting boolean functions",

abstract = "A Boolean function g is said to be an optimal predictor for another Boolean function f if it minimizes the probability that f(Xn) = g(Y n) among all functions, where Xn is uniform over the Hamming cube and Y n is obtained from Xn by independently flipping each coordinate with probability δ. This paper is about self-predicting functions, which are those that coincide with their optimal predictor.",

keywords = "Boolean functions, Fourier analysis, Optimal prediction, Stability",

author = "Nir Weinberger and Ofer Shayevitz",

note = "Publisher Copyright: {\textcopyright} 2019 Society for Industrial and Applied Mathematics",

year = "2019",

doi = "10.1137/18M1207119",

language = "אנגלית",

volume = "33",

pages = "665--693",

journal = "SIAM Journal on Discrete Mathematics",

issn = "0895-4801",

publisher = "Society for Industrial and Applied Mathematics (SIAM)",

number = "2",

}