{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T01:09:41Z","timestamp":1726448981595},"reference-count":8,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1992,3]]},"DOI":"10.1016\/0020-0190(92)90180-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"199-201","source":"Crossref","is-referenced-by-count":8,"title":["The graph of multiplication is equivalent to counting"],"prefix":"10.1016","volume":"41","author":[{"given":"Samuel R.","family":"Buss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90180-4_BIB1","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","article-title":"On uniformity within NC1","volume":"41","author":"Barrington","year":"1990","journal-title":"J. Comput. System Sci."},{"year":"1986","series-title":"Bounded Arithmetic","author":"Buss","key":"10.1016\/0020-0190(92)90180-4_BIB2"},{"key":"10.1016\/0020-0190(92)90180-4_BIB3","first-page":"123","article-title":"The Boolean formula value problem is in ALOGTIME","author":"Buss","year":"1987","journal-title":"Proc. 19th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(92)90180-4_BIB4","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 J. Comput."},{"key":"10.1016\/0020-0190(92)90180-4_BIB5","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\/0020-0190(92)90180-4_BIB6","series-title":"Proc. 19th Annual Symp. on Foundations of Computer Science","first-page":"193","article-title":"Model theoretic aspects of computational complexity","author":"Lipton","year":"1978"},{"key":"10.1016\/0020-0190(92)90180-4_BIB7","article-title":"Sharply bounded predicates do not exhaust the polynomial time computable predicates, part I & II","author":"Mancivi","year":"1990","journal-title":"Typeset manuscript"},{"key":"10.1016\/0020-0190(92)90180-4_BIB8","series-title":"Model Theory of Algebra and Arithmetic","first-page":"363","article-title":"Applications of complexity theory to \u03a30-definability problems in arithmetic","author":"Wilkie","year":"1979"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019092901804?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019092901804?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:26:31Z","timestamp":1555143991000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019092901804"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["0020019092901804"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90180-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}