Approximating the noise sensitivity of a monotone Boolean function
暂无分享,去创建一个
[1] G. Kalai. Noise sensitivity and chaos in social choice theory , 2005 .
[2] Michel Talagrand,et al. How much are increasing sets positively correlated? , 1996, Comb..
[3] Guy Kindler,et al. Quantitative relation between noise sensitivity and influences , 2010, Comb..
[4] Ryan O'Donnell,et al. Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? , 2007, SIAM J. Comput..
[5] Rocco A. Servedio,et al. Learning intersections and thresholds of halfspaces , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[6] Ryan O'Donnell,et al. Polynomial regression under arbitrary product distributions , 2010, Machine Learning.
[7] Ryan O'Donnell,et al. Analysis of Boolean Functions , 2014, ArXiv.
[8] Y. Peres. Noise Stability of Weighted Majority , 2004, math/0412377.
[9] Rocco A. Servedio,et al. New Algorithms and Lower Bounds for Monotonicity Testing , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[10] Seshadhri Comandur,et al. An o(n) Monotonicity Tester for Boolean Functions over the Hypercube , 2016, SIAM J. Comput..
[11] Prasad Raghavendra,et al. Average Sensitivity and Noise Sensitivity of Polynomial Threshold Functions , 2014, SIAM J. Comput..
[12] Daniel M. Kane. The average sensitivity of an intersection of half spaces , 2014 .
[13] R. O'Donnell,et al. Computational applications of noise sensitivity , 2003 .
[14] Maria-Florina Balcan,et al. Active Property Testing , 2011, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[15] Eric Blais,et al. A polynomial lower bound for testing monotonicity , 2016, STOC.
[16] Ryan O'Donnell,et al. Coin flipping from a cosmic source: On error correction of truly random bits , 2004, Random Struct. Algorithms.
[17] Ryan O'Donnell,et al. Hardness amplification within NP , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[18] Daniel M. Kane. The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions , 2010, Computational Complexity Conference.
[19] Elchanan Mossel,et al. On the noise sensitivity of monotone functions , 2003, Random Struct. Algorithms.
[20] Subhash Khot,et al. On Monotonicity Testing and Boolean Isoperimetric Type Theorems , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[21] Ronitt Rubinfeld,et al. Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity , 2011, APPROX-RANDOM.
[22] I. Benjamini,et al. Noise sensitivity of Boolean functions and applications to percolation , 1998 .
[23] Prasad Raghavendra,et al. Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling , 2008, STOC.
[24] Pravesh Kothari,et al. Submodular functions are noise stable , 2012, SODA.
[25] Rocco A. Servedio,et al. Agnostically learning halfspaces , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).