{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:44Z","timestamp":1725663584835},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540534143"},{"type":"electronic","value":"9783540468691"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-53414-8_32","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:02:50Z","timestamp":1330207370000},"page":"93-108","source":"Crossref","is-referenced-by-count":3,"title":["Complexity issues in discrete neurocomputing"],"prefix":"10.1007","author":[{"given":"Juraj","family":"Wiedermann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Adlemann, L.: Two Theorems on Random Polynomial Time, Proc. 19-th FOCS, Washington D. C., 1978, pp. 75\u201383","DOI":"10.1109\/SFCS.1978.37"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0364-0213(85)80012-4","volume":"9","author":"D. N. Ackley","year":"1985","unstructured":"Ackley, D. N. \u2014 Hinton, G. E. \u2014 Sejnowski, T.I.: A Learning Algorithm for Boltzmann Machines. Cognitive Science 9, 1985, pp. 147\u2013169","journal-title":"Cognitive Science"},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"3241","DOI":"10.1088\/0305-4470\/15\/10\/028","volume":"15","author":"F. Barahona","year":"1982","unstructured":"Barahona, F.: On the Computational Complexity of Ising Spin Glass Models. J. Phys. A. 15, 1982, pp. 3241\u20133253","journal-title":"J. Phys. A."},{"key":"6_CR4","first-page":"649","volume":"3","author":"J. Bruck","year":"1987","unstructured":"Bruck, J. \u2014 Goodman, J. W.: A Generalized Convergence Theorem for Neural Networks and Its Application in Combinatorial Optimization. Proc. IEEE First International Conf. on Neural Networks, Vol. 3, 1987, pp.649\u2013656","journal-title":"Proc. IEEE First International Conf. on Neural Networks"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A. K. Chandra","year":"1981","unstructured":"Chandra, A. K. \u2014 Kozen, D. C. \u2014 Stockmeyer, L. I.: Alternation. JACM 28, 1981, pp. 114\u2013133","journal-title":"JACM"},{"issue":"3","key":"6_CR6","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/0213028","volume":"15","author":"A. K. Chandra","year":"1984","unstructured":"Chandra, A. K. \u2014 Stockmeyer, L. I. \u2014 Vishkin, U.: Constant Depth Reducibility. SIAM J. Comput. Vol. 15, No. 3, 1984, pp. 423\u2013432","journal-title":"SIAM J. Comput."},{"key":"6_CR7","series-title":"Tech. Rep.","volume-title":"Computable Functions and Complexity in neural networks","author":"O. Egecioglu","year":"1986","unstructured":"Egecioglu, O. \u2014 Smith, T.R. \u2014 Moody, I.: Computable Functions and Complexity in neural networks. Tech. Rep. ITP-124, University of California, Santa Barbara, 1986"},{"key":"6_CR8","doi-asserted-by":"crossref","first-page":"1469","DOI":"10.1364\/AO.24.001469","volume":"24","author":"N. H. Farhat","year":"1985","unstructured":"Farhat, N. H. \u2014 Psaltis, D. \u2014 Prata, A. \u2014 Paek, E.: Optical Implementation of the Hopfield Model. Applied Optics, 24, 1985, pp. 1469\u20131475","journal-title":"Applied Optics"},{"key":"6_CR9","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0020-0190(88)90024-5","volume":"27","author":"U. Faigle","year":"1988","unstructured":"Faigle, U. \u2014 Schrader, R.: On the Convergence Of Stationary Distributions in Simulated Annealing Algorithms. Inf. Proc. Letters, 27, 1988, pp. 189\u2013194","journal-title":"Inf. Proc. Letters"},{"key":"6_CR10","unstructured":"Feldman, J. A.: Energy and the Behavior of Connectionist Models. Tech. Rep. TR-155, University of Rochester, Nov. 1985"},{"key":"6_CR11","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R. \u2014 Johnson, D. S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman and Co., San Francisco, 1979"},{"key":"6_CR12","doi-asserted-by":"crossref","first-page":"2554","DOI":"10.1073\/pnas.79.8.2554","volume":"79","author":"J. J. Hopfield","year":"1982","unstructured":"Hopfield, J. J.: Neural Networks and Physical Systems with Emergent Collective Computational Abilities. Proc. Natl. Acad. Sci. USA 79, 1982, pp. 2554\u20132558","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Hopfield, J. J.: Neurons with Graded Response Have Collective Computational Properties Like Those of Two-state Neurons. Proc. Natl. Acad. Sci. USA, 1984, pp. 3088\u20133092","DOI":"10.1073\/pnas.81.10.3088"},{"key":"6_CR14","unstructured":"Hopfield, J. J.: The Effectiveness of Neural Computing. Proc. IFIP'89, North-Holland, 1989, pp. 503\u2013507"},{"key":"6_CR15","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","volume":"52","author":"J. J. Hopfield","year":"1985","unstructured":"Hopfield, J. J. \u2014 Tank, D. W.: 'Neural\u2019 Computations of Decisions in Optimization Problems. Biol. Cybern. 52, 1985, pp. 141\u2013152","journal-title":"Biol. Cybern."},{"key":"6_CR16","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1126\/science.3755256","volume":"233","author":"J. J. Hopfield","year":"1986","unstructured":"Hopfield, J. J. \u2014 Tank, D. W.: Computing with Neural Circuits: A Model. Science 233, 1986, pp.625\u2013633","journal-title":"Science"},{"key":"6_CR17","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/0743-7315(89)90068-3","volume":"6","author":"J. l. Johnson","year":"1989","unstructured":"Johnson, J. l.: A Neural Network Approach to the 3-Satisfiability Problem. J. of Parall. and Distrib. Comput. 6, 1989, pp. 435\u2013449","journal-title":"J. of Parall. and Distrib. Comput."},{"key":"6_CR18","doi-asserted-by":"crossref","first-page":"4598","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S. \u2014 Gellat, C. D., Jr. \u2014 Vecchi, M. P.: Optimization by Simulated Annealing. Science, 220, No. 4598, 1983","journal-title":"Science"},{"key":"6_CR19","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0743-7315(89)90064-6","volume":"6","author":"J. H. M. Korst","year":"1989","unstructured":"Korst,. J. H. M. \u2014 Arts, E. H. L.: Combinatorial Optimization on a Boltzmann Machine. J. of Parall. and Distrib. Comput. 6, 1989, pp. 331\u2013357","journal-title":"J. of Parall. and Distrib. Comput."},{"key":"6_CR20","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N. Metropolis","year":"1953","unstructured":"Metropolis, N. \u2014 Rosenbluth, A. \u2014 Rosenbluth, M. \u2014 Teller, A. \u2014 Teller, E.: J. Chem. Phys., 21, 1087, 1953","journal-title":"J. Chem. Phys."},{"key":"6_CR21","volume-title":"Computation. Finite and Infinite Machines","author":"M. Minsky","year":"1967","unstructured":"Minsky, M.: Computation. Finite and Infinite Machines. Prentice Hall, Englewood Cliffs, NJ, 1967"},{"key":"6_CR22","volume-title":"Threshold Logic and Its Applications","author":"S. Muroga","year":"1971","unstructured":"Muroga, S.: Threshold Logic and Its Applications. Wiley-Interscience, New York, 1971"},{"key":"6_CR23","volume-title":"Perceptrons. An Introduction to Computational Geometry","author":"M. Minsky","year":"1969","unstructured":"Minsky, M. \u2014 Papert, S.: Perceptrons. An Introduction to Computational Geometry. The MIT Press, Cambridge, Mass., 1969"},{"issue":"9","key":"6_CR24","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1109\/T-C.1970.223046","volume":"C-19","author":"S. Muroga","year":"1970","unstructured":"Muroga, S. \u2014 Tsubi, T. \u2014 Baugh, Ch. R.: Enumeration of Threshold Functions of Eight Variables. IEEE Trans. on Comp., C-19, No. 9, 1970, pp. 818\u2013825","journal-title":"IEEE Trans. on Comp."},{"key":"6_CR25","unstructured":"Parberry, I.: A Primer on the Complexity Theory of Neural Networks. Research Report CS-88-38, Dept. of Comp. Sci., The Pennsylvania state university, October 1988"},{"key":"6_CR26","first-page":"278","volume":"36","author":"I. Parberry","year":"1988","unstructured":"Parberry, I. \u2014 Schnitger, G.: Parallel Computation with Threshold Functions. JCSS 36, 1988, pp. 278\u2013302","journal-title":"JCSS"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Parberry, I. \u2014 Schnitger, G.: Relating Boltzmann Machines to Conventional models of Computations. Neural Networks, 2, 1989","DOI":"10.1016\/0893-6080(89)90015-4"},{"key":"6_CR28","unstructured":"Reif, J. H. \u2014 Tate, S. R.: On Threshold Circuits and Polynomial Computation. Technical Report, Dept. of Comp. Sci., Duke University, 1988"},{"key":"6_CR29","unstructured":"Robson, J. M.: Linear Size Formulas for Non-deterministic Single Tape Computations. Proc. 11-th Australian Comp. Sci. Conference, Brisbane, Feb. 3\u20135, 1988"},{"key":"6_CR30","unstructured":"van Emde Boas, P.: Machine Models and Simulations. ITLI Prepublication Series of Computation and Complexity Theory CT-88-95, University of Amsterdam, 1988"},{"key":"6_CR31","unstructured":"Wiedermann, J.: On the Computational Power of Neural Networks and Related Computational Systems. Technical Report OPS-9\/1988, Department of Programming Systems, VUSEI-AR, Bratislava, June 1988 (in Slovak), also in Proc. SOFSEM'88, VUSEI-AR Bratislava, November 1988, pp. 73\u201378"},{"key":"6_CR32","first-page":"545","volume-title":"Proc. 14-th Symp. on Math. Found. of Comp. Sci., MFCS'89, LNCS Vol. 379","author":"J. Wiedermann","year":"1989","unstructured":"Wiedermann, J.: On the Computational Efficiency of Symmetric Neural Networks. Proc. 14-th Symp. on Math. Found. of Comp. Sci., MFCS'89, LNCS Vol. 379, Springer Verlag, Berlin, 1989, pp. 545\u2013552"}],"container-title":["Lecture Notes in Computer Science","Aspects and Prospects of Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53414-8_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T18:04:25Z","timestamp":1687284265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53414-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540534143","9783540468691"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/3-540-53414-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}