Andrew Wan, Ph.D. - Publications
Affiliations: | 2010 | Columbia University, New York, NY |
Area:
Cryptography, Complexity Theory, Security, Randomized AlgorithmsYear | Citation | Score | |||
---|---|---|---|---|---|
2014 | Diakonikolas I, Servedio RA, Tan L, Wan A. A Regularity Lemma and Low-Weight Approximators for Low-Degree Polynomial Threshold Functions Theory of Computing. 10: 27-53. DOI: 10.4086/Toc.2014.V010A002 | 0.348 | |||
2011 | Jackson JC, Lee HK, Servedio RA, Wan A. Learning random monotone DNF Discrete Applied Mathematics. 159: 259-271. DOI: 10.1016/J.Dam.2010.08.022 | 0.442 | |||
2011 | Diakonikolas I, Lee HK, Matulef K, Servedio RA, Wan A. Efficiently testing sparse GF(2) polynomials Algorithmica (New York). 61: 580-605. DOI: 10.1007/S00453-010-9426-9 | 0.445 | |||
2007 | Lee HK, Servedio RA, Wan A. DNF are teachable in the average case Machine Learning. 69: 79-96. DOI: 10.1007/S10994-007-5007-9 | 0.401 | |||
2005 | Servedio RA, Wan A. Computing sparse permanents faster Information Processing Letters. 96: 89-92. DOI: 10.1016/J.Ipl.2005.06.007 | 0.34 | |||
Show low-probability matches. |