{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:50Z","timestamp":1725663650012},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540194880"},{"type":"electronic","value":"9783540392910"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-19488-6_127","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:13:48Z","timestamp":1330182828000},"page":"347-361","source":"Crossref","is-referenced-by-count":4,"title":["On the learnability of DNF formulae"],"prefix":"10.1007","author":[{"given":"L.","family":"Kucera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Marchetti-Spaccamela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Protasi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"A.Blumer,A.Ehrenfeucht,D.Haussler,M.Warmuth Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension Proc. 18th Acm Symposium on Theory of Computing (1986)","DOI":"10.1145\/12130.12158"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"G.M.Benedek,A.Itai Non uniform learnability (These proceedings) (1988)","DOI":"10.1007\/3-540-19488-6_108"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"P.Berman,R.Roos Learning one-counter languages in polynomial time Proc. 28th Symposium on Foundations of Computer Science (1987)","DOI":"10.1109\/SFCS.1987.36"},{"key":"25_CR4","unstructured":"A.Ehrenfeucht,D.Haussler,M.Kearns,L.Valiant A general lower bound on the number of examples needed for learning (to appear)"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"M.Kearns,M.Li,L.Pitt,L.G.Valiant On the learnability of boolean formulae Proc.19th Acm Symposium on Theory of Computing (1987)","DOI":"10.1145\/28395.28426"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"N.Littlestone Learning quickly when irrelevant attributes abound: a new linear threshold algorithm Proc. 28th Symposium on Foundations of Computer Science (1987)","DOI":"10.1109\/SFCS.1987.37"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"B.K.Natarajan On learning boolean functions Proc. 19th Symposium on Theory of Computing (1987)","DOI":"10.1145\/28395.28427"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"L.G.Valiant A theory of learnable Comm.Acm, Vol.27,n.11 (1984)","DOI":"10.1145\/1968.1972"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-19488-6_127.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:17:26Z","timestamp":1605626246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-19488-6_127"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540194880","9783540392910"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-19488-6_127","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}