{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:19:04Z","timestamp":1725567544516},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642163661"},{"type":"electronic","value":"9783642163678"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16367-8_27","type":"book-chapter","created":{"date-parts":[[2010,10,7]],"date-time":"2010-10-07T15:25:55Z","timestamp":1286465155000},"page":"334-340","source":"Crossref","is-referenced-by-count":0,"title":["Testing (Subclasses of) Halfspaces"],"prefix":"10.1007","author":[{"given":"Kevin","family":"Matulef","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryan","family":"O\u2019Donnell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronitt","family":"Rubinfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rocco","family":"Servedio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/A:1007458528570","volume":"30","author":"A. Birkendorf","year":"1998","unstructured":"Birkendorf, A., Dichterman, E., Jackson, J., Klasner, N., Simon, H.U.: On restricted-focus-of-attention learnability of Boolean functions. Machine Learning\u00a030, 89\u2013123 (1998)","journal-title":"Machine Learning"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1103\/RevModPhys.34.123","volume":"34","author":"H. Block","year":"1962","unstructured":"Block, H.: The Perceptron: a model for brain functioning. Reviews of Modern Physics\u00a034, 123\u2013135 (1962)","journal-title":"Reviews of Modern Physics"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Chow, C.K.: On the characterization of threshold functions. In: Proceedings of the Symposium on Switching Circuit Theory and Logical Design (FOCS), pp. 34\u201338 (1961)","DOI":"10.1109\/FOCS.1961.24"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Diakonikolas, I., Lee, H., Matulef, K., Onak, K., Rubinfeld, R., Servedio, R., Wan, A.: Testing for concise representations. In: Proc. 48th Ann. Symposium on Computer Science (FOCS), pp. 549\u2013558 (2007)","DOI":"10.1109\/FOCS.2007.32"},{"key":"27_CR5","first-page":"97","volume":"75","author":"E. Fischer","year":"2001","unstructured":"Fischer, E.: The art of uninformed decisions: A primer to property testing. Bulletin of the European Association for Theoretical Computer Science\u00a075, 97\u2013126 (2001)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"27_CR6","unstructured":"Fischer, E., Kindler, G., Ron, D., Safra, S., Samorodnitsky, A.: Testing juntas. In: Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, pp. 103\u2013112 (2002)"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1137\/S0895480103426765","volume":"20","author":"P. Goldberg","year":"2006","unstructured":"Goldberg, P.: A Bound on the Precision Required to Estimate a Boolean Perceptron from its Average Satisfying Assignment. SIAM Journal on Discrete Mathematics\u00a020, 328\u2013343 (2006)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O. Goldreich","year":"1998","unstructured":"Goldreich, O., Goldwaser, S., Ron, D.: Property testing and its connection to learning and approximation. Journal of the ACM\u00a045, 653\u2013750 (1998)","journal-title":"Journal of the ACM"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0022-0000(93)90001-D","volume":"46","author":"A. Hajnal","year":"1993","unstructured":"Hajnal, A., Maass, W., Pudlak, P., Szegedy, M., Turan, G.: Threshold circuits of bounded depth. Journal of Computer and System Sciences\u00a046, 129\u2013154 (1993)","journal-title":"Journal of Computer and System Sciences"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Hellerstein, L.: On generalized constraints and certificates. Discrete Mathematics\u00a0226(211-232) (2001)","DOI":"10.1016\/S0012-365X(00)00166-7"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1023\/A:1022627018023","volume":"11","author":"S. Kulkarni","year":"1993","unstructured":"Kulkarni, S., Mitter, S., Tsitsiklis, J.: Active learning using arbitrary binary valued queries. Machine Learning\u00a011, 23\u201335 (1993)","journal-title":"Machine Learning"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1007\/978-3-642-03685-9_48","volume-title":"APPROX-RANDOM 2009","author":"K. Matulef","year":"2009","unstructured":"Matulef, K., Rubinfeld, R., Servedio, R.A., O\u2019Donnell, R.: Testing {-1,1} - Weight Halfspaces. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX-RANDOM 2009. LNCS, vol.\u00a05687, pp. 646\u2013657. Springer, Heidelberg (2009)"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Matulef, K., O\u2019Donnell, R., Rubinfeld, R., Servedio, R.A.: Testing halfspaces. In: 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 256\u2013264 (2009)","DOI":"10.1137\/1.9781611973068.29"},{"key":"27_CR14","volume-title":"Perceptrons: an introduction to computational geometry","author":"M. Minsky","year":"1968","unstructured":"Minsky, M., Papert, S.: Perceptrons: an introduction to computational geometry. MIT Press, Cambridge (1968)"},{"key":"27_CR15","unstructured":"Novikoff, A.: On convergence proofs on perceptrons. In: Proceedings of the Symposium on Mathematical Theory of Automata, vol.\u00a0XII, pp. 615\u2013622 (1962)"},{"issue":"2","key":"27_CR16","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/s00037-007-0228-7","volume":"16","author":"R. Servedio","year":"2007","unstructured":"Servedio, R.: Every linear threshold function has a low-weight approximator. Computational Complexity\u00a016(2), 180\u2013209 (2007)","journal-title":"Computational Complexity"},{"key":"27_CR17","volume-title":"An introduction to support vector machines","author":"J. Shawe-Taylor","year":"2000","unstructured":"Shawe-Taylor, J., Cristianini, N.: An introduction to support vector machines. Cambridge University Press, Cambridge (2000)"},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Yao, A.: On ACC and threshold circuits. In: Proceedings of the Thirty-First Annual Symposium on Foundations of Computer Science, pp. 619\u2013627 (1990)","DOI":"10.1109\/FSCS.1990.89583"}],"container-title":["Lecture Notes in Computer Science","Property Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16367-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T09:10:39Z","timestamp":1559725839000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16367-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163661","9783642163678"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16367-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}