{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T11:39:48Z","timestamp":1649072388284},"reference-count":31,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neural Networks"],"published-print":{"date-parts":[[1989,1]]},"DOI":"10.1016\/0893-6080(89)90015-4","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T01:05:53Z","timestamp":1051232753000},"page":"59-67","source":"Crossref","is-referenced-by-count":11,"title":["Relating Boltzmann machines to conventional models of computation"],"prefix":"10.1016","volume":"2","author":[{"given":"Ian","family":"Parberry","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georg","family":"Schnitger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0893-6080(89)90015-4_BIB1","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1207\/s15516709cog0901_7","article-title":"A learning algorithm for Boltzmann machines","volume":"9","author":"Ackley","year":"1985","journal-title":"Cognitive Science"},{"key":"10.1016\/0893-6080(89)90015-4_BIB2","series-title":"Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science","first-page":"75","article-title":"Two theorems on random polynomial time","author":"Adleman","year":"1978"},{"key":"10.1016\/0893-6080(89)90015-4_BIB3","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF02582959","article-title":"Asynchronous threshold networks","volume":"1","author":"Alon","year":"1985","journal-title":"Graphs and Combinatorics"},{"key":"10.1016\/0893-6080(89)90015-4_BIB4","series-title":"Proceedings of the 9th Annual ACM Symposium on Theory of Computing","first-page":"30","article-title":"Fast probabilistic algorithms for Hamiltonian circuits and matchings","author":"Angluin","year":"1977"},{"key":"10.1016\/0893-6080(89)90015-4_BIB5","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/0213028","article-title":"Constant depth reducibility","volume":"13","author":"Chandra","year":"1984","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/0893-6080(89)90015-4_BIB6","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","article-title":"A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations","volume":"23","author":"Chernoff","year":"1952","journal-title":"Annals of Mathematical Statistics"},{"key":"10.1016\/0893-6080(89)90015-4_BIB7","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01744431","article-title":"Parity, circuits and the polynomial time hierarchy","volume":"17","author":"Furst","year":"1984","journal-title":"Mathematical Systems Theory"},{"key":"10.1016\/0893-6080(89)90015-4_BIB8","article-title":"The computational complexity of the stable state problem for connectionist models","author":"Godbeer","year":"1987"},{"key":"10.1016\/0893-6080(89)90015-4_BIB9","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0304-3975(86)90165-9","article-title":"On the construction of parallel computers from various bases of Boolean functions","volume":"43","author":"Goldschlager","year":"1986","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0893-6080(89)90015-4_BIB10","first-page":"282","article-title":"Learning and relearning in Boltzmann machines","volume":"Vol. 1","author":"Hinton","year":"1986"},{"key":"10.1016\/0893-6080(89)90015-4_BIB11","article-title":"Boltzmann machines: Constraint satisfaction networks that learn","author":"Hinton","year":"1984"},{"key":"10.1016\/0893-6080(89)90015-4_BIB12","first-page":"2554","article-title":"Neural networks and physical systems with emergent collective computational abilities","volume":"79","author":"Hopfield","year":"1982"},{"key":"10.1016\/0893-6080(89)90015-4_BIB13","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/0893-6080(89)90015-4_BIB14","series-title":"On connectionist models","author":"Hong","year":"1987"},{"key":"10.1016\/0893-6080(89)90015-4_BIB15","series-title":"Computational power for networks of threshold devices in an asynchronous environment","author":"Lepley","year":"1984"},{"key":"10.1016\/0893-6080(89)90015-4_BIB16","article-title":"On the computational complexity of finding a connectionist model's stable state vectors","author":"Lipscomb","year":"1987"},{"key":"10.1016\/0893-6080(89)90015-4_BIB17","series-title":"Proceedings of the 17th Annual ACM Symposium on Theory of Computing","first-page":"1","article-title":"A simple parallel algorithm for the maximal independent set problem","author":"Luby","year":"1985"},{"key":"10.1016\/0893-6080(89)90015-4_BIB18","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/0016-0032(61)90702-5","article-title":"Theory of majority decision elements","volume":"271","author":"Muroga","year":"1961","journal-title":"Journal of the Franklin Institute"},{"key":"10.1016\/0893-6080(89)90015-4_BIB19","series-title":"Threshold logic and its applications","author":"Muroga","year":"1971"},{"key":"10.1016\/0893-6080(89)90015-4_BIB20","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0020-0190(87)90112-8","article-title":"An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits","volume":"24","author":"Parberry","year":"1987","journal-title":"Information Processing Letters"},{"key":"10.1016\/0893-6080(89)90015-4_BIB21","series-title":"Proceedings of the Structure in Complexity Theory Conference","first-page":"272","article-title":"Parallel computation with threshold functions [Preliminary Version]","volume":"Vol. 223","author":"Parberry","year":"1986"},{"key":"10.1016\/0893-6080(89)90015-4_BIB22","series-title":"Proceedings of the 2nd International Symposium on Methodologies for Intelligent Systems","first-page":"347","article-title":"Relating Boltzmann machines to conventional models of computation","author":"Parberry","year":"1987"},{"issue":"3","key":"10.1016\/0893-6080(89)90015-4_BIB23","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0022-0000(88)90030-X","article-title":"Parallel computation with threshold functions","volume":"36","author":"Parberry","year":"1988","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/0893-6080(89)90015-4_BIB24","series-title":"Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science","first-page":"307","article-title":"On simultaneous resource bounds","author":"Pippenger","year":"1979"},{"key":"10.1016\/0893-6080(89)90015-4_BIB25","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF02579347","article-title":"On periodical behavior in societies with symmetric influences","volume":"3","author":"Poljak","year":"1983","journal-title":"Combinatorica"},{"key":"10.1016\/0893-6080(89)90015-4_BIB26","article-title":"Stability and looping in connectionist models with asymmetric weights","author":"Porat","year":"1987"},{"key":"10.1016\/0893-6080(89)90015-4_BIB27","series-title":"Proceedings of the 2nd Structure in Complexity Theory Conference","first-page":"118","article-title":"On threshold circuits and polynomial computation","author":"Reif","year":"1987"},{"key":"10.1016\/0893-6080(89)90015-4_BIB28","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","article-title":"On uniform circuit complexity","volume":"22","author":"Ruzzo","year":"1981","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/0893-6080(89)90015-4_BIB29","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1145\/321724.321731","article-title":"Computational work and time on finite machines","volume":"19","author":"Savage","year":"1972","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/0893-6080(89)90015-4_BIB30","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1137\/0213027","article-title":"Simulation of parallel random access machines by circuits","volume":"13","author":"Stockmeyer","year":"1984","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/0893-6080(89)90015-4_BIB31","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1137\/0211027","article-title":"A scheme for fast parallel communication","volume":"11","author":"Valiant","year":"1982","journal-title":"SIAM Journal on Computing"}],"container-title":["Neural Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0893608089900154?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0893608089900154?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T14:58:02Z","timestamp":1553266682000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0893608089900154"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["0893608089900154"],"URL":"https:\/\/doi.org\/10.1016\/0893-6080(89)90015-4","relation":{},"ISSN":["0893-6080"],"issn-type":[{"value":"0893-6080","type":"print"}],"subject":[],"published":{"date-parts":[[1989,1]]}}}