{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:16:07Z","timestamp":1725664567858},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540604549"},{"type":"electronic","value":"9783540474708"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60454-5_40","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:30:13Z","timestamp":1330263013000},"page":"215-227","source":"Crossref","is-referenced-by-count":1,"title":["Complexity of network training for classes of Neural Networks"],"prefix":"10.1007","author":[{"given":"Charles C.","family":"Pinter","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0885-064X(90)90012-3","volume":"6","author":"E.B. Baum","year":"1990","unstructured":"Baum, E.B.: On learning a union of halfspaces. Journal of Complexity 6 (1990) 67\u2013101","journal-title":"Journal of Complexity"},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1162\/neco.1990.2.4.510","volume":"2","author":"E.B. Baum","year":"1990","unstructured":"Baum, E.B.: A polynomial time algorithm that learns two hidden unit nets. Neural Computation 2 (1990) 510\u2013522","journal-title":"Neural Computation"},{"key":"16_CR3","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/72.80287","volume":"2","author":"E.B. Baum","year":"1991","unstructured":"Baum, E.B.: Neural net algorithms that learn in polynomial time from examples and queries. IEEE Trans. on Neural Networks 2 (1991) 5\u201319","journal-title":"IEEE Trans. on Neural Networks"},{"key":"16_CR4","unstructured":"Blum, A.L., Rivest, R.L.: Training a 3-node neural network is NP-complete. Machine Learning: From Theory to Applications, Springer-Verlag (1993) 9\u201328"},{"key":"16_CR5","unstructured":"DasGupta, B., Siegelmann, H., Sontag, E.: On a learnability question associated with neural networks with continuous activations. Proc. of the 7th Annual ACM Conference on Computational Learning Theory (1994) 47\u201356"},{"key":"16_CR6","first-page":"161","volume":"16","author":"M. Golea","year":"1994","unstructured":"Golea, M., Hancock, T., Marchand, M.: Learning nonoverlapping perceptron networks from examples and membership queries. Machine Learning 16 (1994) 161\u2013183","journal-title":"Machine Learning"},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0885-064X(88)90019-2","volume":"4","author":"J.S. Judd","year":"1988","unstructured":"Judd, J.S.: On the complexity of loading shallow neural networks. Journal of Complexity 4 (1988) 177\u2013192","journal-title":"Journal of Complexity"},{"key":"16_CR8","first-page":"211","volume":"6","author":"J.H. Lin","year":"1991","unstructured":"Lin, J.H., Vitter, J.S.: Complexity results on learning by neural nets. Machine Learning 6 (1991) 211\u2013230","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60454-5_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:25:26Z","timestamp":1619558726000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60454-5_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540604549","9783540474708"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-60454-5_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}