{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:56Z","timestamp":1759638896489},"reference-count":43,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1988,6,1]],"date-time":"1988-06-01T00:00:00Z","timestamp":581126400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9177,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1988,6]]},"DOI":"10.1016\/0022-0000(88)90030-x","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"278-302","source":"Crossref","is-referenced-by-count":72,"title":["Parallel computation with threshold functions"],"prefix":"10.1016","volume":"36","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\/0022-0000(88)90030-X_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":"Cognit. Sci."},{"key":"10.1016\/0022-0000(88)90030-X_BIB2","series-title":"Proceedings, 19th Ann. IEEE Symp. on Foundations of Computer Science","first-page":"75","article-title":"Two theorems on random polynomial time","author":"Adleman","year":"1978"},{"key":"10.1016\/0022-0000(88)90030-X_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(83)90038-6","article-title":"\u03a311-formulae on finite structures","volume":"24","author":"Ajtai","year":"1983","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0022-0000(88)90030-X_BIB4","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0020-0190(83)90041-8","article-title":"A note on the \u201cparallel computation thesis,\u201d","volume":"17","author":"Blum","year":"1983","journal-title":"Inform. Process. Lett."},{"issue":"No. 1","key":"10.1016\/0022-0000(88)90030-X_BIB5","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 2","key":"10.1016\/0022-0000(88)90030-X_BIB6","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1137\/0213028","article-title":"Constant depth reducibility","volume":"13","author":"Chandra","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(88)90030-X_BIB7","article-title":"Towards a complexity theory of synchronous parallel computation","volume":"30","author":"Cook","year":"1980","journal-title":"L'Enseign. Math."},{"key":"10.1016\/0022-0000(88)90030-X_BIB8","article-title":"Simultaneous Resource Bounds and Parallel Computations","author":"Dymond","year":"1980"},{"key":"10.1016\/0022-0000(88)90030-X_BIB9","series-title":"Proceedings, 21 st Annu. IEEE Symp. on Foundations of Computer Science","first-page":"360","article-title":"Hardware complexity and parallel computation","author":"Dymond","year":"1980"},{"key":"10.1016\/0022-0000(88)90030-X_BIB10","first-page":"1901","article-title":"Very high-speed computing systems","volume":"54","author":"Flynn","year":"1966"},{"key":"10.1016\/0022-0000(88)90030-X_BIB11","series-title":"Proceedings, 10th Annu. ACM Symp. on Theory of Computing","first-page":"114","article-title":"Parallelism in random access machines","author":"Fortune","year":"1978"},{"issue":"No. 1","key":"10.1016\/0022-0000(88)90030-X_BIB12","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":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(88)90030-X_BIB13","article-title":"Synchronous Parallel Computation","author":"Goldschlager","year":"1977"},{"issue":"No. 4","key":"10.1016\/0022-0000(88)90030-X_BIB14","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1145\/322344.322353","article-title":"A universal interconnection pattern for parallel computers","volume":"29","author":"Goldschlager","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(88)90030-X_BIB15","series-title":"Technical Report","article-title":"A Computational Theory of Higher Brain Function","author":"Goldschlager","year":"1984"},{"issue":"No. 1","key":"10.1016\/0022-0000(88)90030-X_BIB16","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":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(88)90030-X_BIB17","series-title":"Proceedings, 15th Annu. IEEE Symp. on Switching and Automata Theory","first-page":"13","article-title":"On the power of multiplication in random access machines","author":"Hartmanis","year":"1974"},{"key":"10.1016\/0022-0000(88)90030-X_BIB18","series-title":"Technical Report CMU-CS-84-119","article-title":"Boltzmann Machines: Constraint Satisfaction Networks That Learn","author":"Hinton","year":"1984"},{"issue":"No. 2","key":"10.1016\/0022-0000(88)90030-X_BIB19","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1145\/322003.322015","article-title":"On time versus space","volume":"24","author":"Hopcroft","year":"1977","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(88)90030-X_BIB20","first-page":"2554","article-title":"Neural networks and physical systems with emergent collective computational abilities","volume":"79","author":"Hopfield","year":"1982"},{"key":"10.1016\/0022-0000(88)90030-X_BIB21","series-title":"Proceedings, 17th Annu. ACM Symp. 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\/0022-0000(88)90030-X_BIB22","unstructured":"W. MAASS, personal communication, 1985"},{"key":"10.1016\/0022-0000(88)90030-X_BIB23","article-title":"A Complexity Theory of Parallel Computation","author":"Parberry","year":"1984"},{"key":"10.1016\/0022-0000(88)90030-X_BIB24","series-title":"Technical Report CS-85-17","article-title":"On the Number of Processors Required to Simulate Turing Machines in Constant Parallel Time","author":"Parberry","year":"1985"},{"issue":"No. 1","key":"10.1016\/0022-0000(88)90030-X_BIB25","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1145\/8312.8317","article-title":"Parallel speedup of sequential machines: A defense of the parallel computation thesis","volume":"18","author":"Parberry","year":"1986","journal-title":"SIGACT News"},{"key":"10.1016\/0022-0000(88)90030-X_BIB26","series-title":"Proceedings, 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\/0022-0000(88)90030-X_BIB27","series-title":"Technical Report CS-87-07","article-title":"Relating Boltzmann Machines to Conventional Models of Computation","author":"Parberry","year":"1987"},{"issue":"No. 2","key":"10.1016\/0022-0000(88)90030-X_BIB28","doi-asserted-by":"crossref","DOI":"10.1016\/S0022-0000(72)80017-5","article-title":"Tape bounds for time-bounded Turing machines","volume":"6","author":"Paterson","year":"1972","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(88)90030-X_BIB29","series-title":"Proceedings, 24th Annu. IEEE Symp. on Foundations of Computer Science","first-page":"429","article-title":"On determinism versus non-determinism and related problems","author":"Paul","year":"1983"},{"key":"10.1016\/0022-0000(88)90030-X_BIB30","series-title":"Proceedings, 20th Annu. IEEE Symp. on Foundations of Computer Science","first-page":"307","article-title":"On simultaneous resource bounds","author":"Pippenger","year":"1979"},{"key":"10.1016\/0022-0000(88)90030-X_BIB31","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/S0022-0000(76)80037-2","article-title":"A characterization of the power of vector machines","volume":"12","author":"Pratt","year":"1976","journal-title":"J. Comput. System Sci."},{"issue":"No. 3","key":"10.1016\/0022-0000(88)90030-X_BIB32","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":"J. Comput. System Sci."},{"issue":"No. 4","key":"10.1016\/0022-0000(88)90030-X_BIB33","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":"J. Assoc. Comput. Mach."},{"issue":"No. 4","key":"10.1016\/0022-0000(88)90030-X_BIB34","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/357114.357116","article-title":"Ultracomputers","volume":"2","author":"Schwartz","year":"1980","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0022-0000(88)90030-X_BIB35","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","article-title":"Finding the maximum, sorting and merging in a parallel computation model","volume":"2","author":"Shiloach","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0022-0000(88)90030-X_BIB36","series-title":"Proceedings, 15th Annu. ACM Symp. on Theory of Computing","first-page":"61","article-title":"Borel sets and circuit complexity","author":"Sipser","year":"1983"},{"issue":"No. 2","key":"10.1016\/0022-0000(88)90030-X_BIB37","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 J. Comput."},{"key":"10.1016\/0022-0000(88)90030-X_BIB38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoret. Comput. Sci."},{"issue":"No. 3","key":"10.1016\/0022-0000(88)90030-X_BIB39","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","article-title":"The Complexity of enumeration and reliability problems","volume":"8","author":"Valiant","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(88)90030-X_BIB40","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"8","author":"Valiant","year":"1979","journal-title":"Theoret. Comput. Sci."},{"issue":"No. 3","key":"10.1016\/0022-0000(88)90030-X_BIB41","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00289117","article-title":"The complexity of combinatorial problems with succinct input representation","volume":"23","author":"Wagner","year":"1986","journal-title":"Acta Inform."},{"key":"10.1016\/0022-0000(88)90030-X_BIB42","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","article-title":"Complete sets and the polynomial-time hierarchy","volume":"3","author":"Wrateiall","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(88)90030-X_BIB43","series-title":"Proceedings, 26th Annu. IEEE Symp. on Foundations of Computer Science","article-title":"Separating the polynomial-time hierarchy by oracles","author":"Yao","year":"1985"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200008890030X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200008890030X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:54:04Z","timestamp":1550325244000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200008890030X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,6]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,6]]}},"alternative-id":["002200008890030X"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(88)90030-x","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1988,6]]}}}