{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T06:46:40Z","timestamp":1648882000957},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"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":8143,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1991,4]]},"DOI":"10.1016\/0304-3975(91)90317-u","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"77-95","source":"Crossref","is-referenced-by-count":0,"title":["On the complexity of counting in the polynomial hierarchy"],"prefix":"10.1016","volume":"81","author":[{"given":"Marek","family":"Piotr\u00f3w","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90317-U_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(83)90038-6","article-title":"\u03a3\u00a6formulas of finite structures","volume":"24","author":"Ajtai","year":"1983","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0304-3975(91)90317-U_BIB2","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0304-3975(79)90043-4","article-title":"A second step toward the polynomial hierarchy","volume":"8","author":"Baker","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90317-U_BIB3","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(85)90168-9","article-title":"On bounded query machines","volume":"40","author":"Balcazar","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90317-U_BIB4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","article-title":"Universal classes of hash functions","volume":"18","author":"Carter","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(91)90317-U_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. System Theory"},{"key":"10.1016\/0304-3975(91)90317-U_BIB6","first-page":"6","article-title":"Almost optimal lower bounds for small depth circuits","author":"Hastad","year":"1986","journal-title":"Proc. 18th ACM STOC"},{"key":"10.1016\/0304-3975(91)90317-U_BIB7","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0022-0000(84)90068-0","article-title":"The complexity of facets (and some facets of complexity)","volume":"28","author":"Papadimitriou","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(91)90317-U_BIB8","series-title":"Methods in Mathematical Logic","first-page":"317","article-title":"Counting problems in bounded arithmetic","volume":"1130","author":"Paris","year":"1985"},{"key":"10.1016\/0304-3975(91)90317-U_BIB9","unstructured":"M. Piotr\u00f3w, On complexity of counting in polynomial hierarchy, TR N-166, Ins. Comp. Sci., Univ. of Wroclaw, Poland."},{"key":"10.1016\/0304-3975(91)90317-U_BIB10","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."},{"key":"10.1016\/0304-3975(91)90317-U_BIB11","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1137\/0214060","article-title":"On approximation algorithms for #P","volume":"14","author":"Stockmeyer","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(91)90317-U_BIB12","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."},{"key":"10.1016\/0304-3975(91)90317-U_BIB13","series-title":"Proc. Logic Colloquium '84","article-title":"Bounded arithmetic formulas and Turing machines of constant alternations","volume":"120","author":"Woods","year":"1986"},{"key":"10.1016\/0304-3975(91)90317-U_BIB14","first-page":"1","article-title":"Seperating the polynomial time hierarchy by oracles","author":"Yao","year":"1985","journal-title":"Proc. 26th FOCS"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190317U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190317U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:53:12Z","timestamp":1555127592000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759190317U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["030439759190317U"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90317-u","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,4]]}}}