The following publications are possibly variants of this publication:
- New degree bounds for polynomial threshold functionsRyan O Donnell, Rocco A. Servedio. stoc 2003: 325-334 [doi]
- Efficient deterministic approximate counting for low-degree polynomial threshold functionsAnindya De, Rocco A. Servedio. stoc 2014: 832-841 [doi]
- Efficient deterministic approximate counting for low degree polynomial threshold functionsAnindya De, Rocco A. Servedio. eccc, 20:173, 2013. [doi]
- A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold FunctionsIlias Diakonikolas, Rocco A. Servedio, Li-Yang Tan, Andrew Wan. coco 2010: 211-222 [doi]
- Deterministic Approximate Counting for Degree-$2$ Polynomial Threshold FunctionsAnindya De, Ilias Diakonikolas, Rocco A. Servedio. eccc, 20:172, 2013. [doi]
- Deterministic Approximate Counting for Juntas of Degree-$2$ Polynomial Threshold FunctionsAnindya De, Ilias Diakonikolas, Rocco A. Servedio. eccc, 20:171, 2013. [doi]
- A Regularity Lemma and Low-Weight Approximators for Low-Degree Polynomial Threshold FunctionsIlias Diakonikolas, Rocco A. Servedio, Li-Yang Tan, Andrew Wan. toc, 10:27-53, 2014. [doi]
- Hardness Results for Agnostically Learning Low-Degree Polynomial Threshold FunctionsIlias Diakonikolas, Ryan O Donnell, Rocco A. Servedio, Yi Wu. soda 2011: 1590-1606 [doi]
- Attribute-Efficient Learning and Weight-Degree Tradeoffs for Polynomial Threshold FunctionsRocco A. Servedio, Li-Yang Tan, Justin Thaler. jmlr, 23, 2012. [doi]