{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T18:47:15Z","timestamp":1649184435579},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"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":[[1998,4]]},"DOI":"10.1016\/s0020-0190(98)00024-6","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"13-20","source":"Crossref","is-referenced-by-count":9,"title":["A note on parallel queries and the symmetric-difference hierarchy"],"prefix":"10.1016","volume":"66","author":[{"given":"Klaus W.","family":"Wagner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00024-6_BIB1","series-title":"Proc. 5th Israeli Symposium on Theory of Computing and Systems","first-page":"159","article-title":"Commutative queries","author":"Beigel","year":"1997"},{"key":"10.1016\/S0020-0190(98)00024-6_BIB2","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01371729","article-title":"A relationship between difference hierarchies and relativized polynomial hierarchies","volume":"26","author":"Beigel","year":"1993","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0020-0190(98)00024-6_BIB3","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0304-3975(91)90160-4","article-title":"Bounded queries to SAT and the boolean hierarchy","volume":"84","author":"Beigel","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(98)00024-6_BIB4","author":"Buhrmann","year":"1996"},{"key":"10.1016\/S0020-0190(98)00024-6_BIB5","series-title":"Proc. 3rd IEEE Conference on Structure in Complexity Theory","first-page":"224","article-title":"On truth-table reducibility to SAT and the difference hierarchy over NP","author":"Buss","year":"1988"},{"key":"10.1016\/S0020-0190(98)00024-6_BIB6","doi-asserted-by":"crossref","first-page":"1232","DOI":"10.1137\/0217078","article-title":"The boolean hierarchy I: Structural properties","volume":"17","author":"Cai","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(98)00024-6_BIB7","series-title":"Proc. 1st Structure in Complexity Theory","first-page":"105","article-title":"The Boolean hierarchy: hardware over NP","volume":"Vol. 223","author":"Cai","year":"1986"},{"key":"10.1016\/S0020-0190(98)00024-6_BIB8","article-title":"Bounded queries, approximation and the boolean hierarchy","author":"Chang","year":"1997"},{"key":"10.1016\/S0020-0190(98)00024-6_BIB9_1","doi-asserted-by":"crossref","unstructured":"L.A. Hemaspaandra, E. Hemaspaandra, H. Hempel, A downward translation in the polynomial hierarchy, in: Proc. 14th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci., Vol. 1200, Springer, Berlin, pp. 319\u2013328.","DOI":"10.1007\/BFb0023469"},{"key":"10.1016\/S0020-0190(98)00024-6_BIB9_2","author":"Hemaspaandra","year":"1997","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(98)00024-6_BIB10","series-title":"Proc. 11th Fundamentals of Computer Science Conference","first-page":"222","article-title":"Query order in the polynomial hierarchy","volume":"Vol. 1279","author":"Hemaspaandra","year":"1997"},{"key":"10.1016\/S0020-0190(98)00024-6_BIB11","author":"Hemaspaandra","year":"1997"},{"key":"10.1016\/S0020-0190(98)00024-6_BIB12","doi-asserted-by":"crossref","unstructured":"L.A. Hemaspaandra, E. Hemaspaandra, G. Wechsung, Query order, SIAM J. Comput., to appear.","DOI":"10.1137\/S0097539796297632"},{"key":"10.1016\/S0020-0190(98)00024-6_BIB13","article-title":"Untersuchungen verschiedener polynomieller Reduktionsklassen von NP","author":"K\u00f6bler","year":"1985"},{"key":"10.1016\/S0020-0190(98)00024-6_BIB14","series-title":"Proc. of 18th Annual Symposium on Theory of Computing","first-page":"69","article-title":"The complexity of optimization problems","author":"Krentel","year":"1986"},{"key":"10.1016\/S0020-0190(98)00024-6_BIB15","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1051\/ita\/1987210404191","article-title":"The difference and the truth table hierarchies for NP","volume":"21","author":"K\u00f6bler","year":"1987","journal-title":"R.A.I.R.O Theoretical Informatics and Applications"},{"key":"10.1016\/S0020-0190(98)00024-6_BIB16","series-title":"Proc. of 13th Annual IEEE Symposium on Switching and Automata Theory","first-page":"125","article-title":"The equivalence problem for regular exressions with squaring requires exponential space","author":"Meyer","year":"1972"},{"key":"10.1016\/S0020-0190(98)00024-6_BIB17","series-title":"Proc. of 6th GI Conference on Theoretical Computer Science","first-page":"269","article-title":"Two remarks on the power of counting","volume":"Vol. 145","author":"Papadimitriou","year":"1983"},{"key":"10.1016\/S0020-0190(98)00024-6_BIB18","series-title":"On boolean lowness and boolean highness, Manuscript","author":"Reith","year":"1998"},{"key":"10.1016\/S0020-0190(98)00024-6_BIB19","series-title":"Proc. of 11th STACS Conference","first-page":"439","article-title":"Two refinements of the polynomial hierarchy","volume":"Vol. 775","author":"Selivanov","year":"1994"},{"key":"10.1016\/S0020-0190(98)00024-6_BIB20","series-title":"Extending the difference hierarchy over NP, Manuscript","author":"Selivanov","year":"1995"},{"key":"10.1016\/S0020-0190(98)00024-6_BIB21","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\/S0020-0190(98)00024-6_BIB22","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0304-3975(87)90049-1","article-title":"More complicated questions about maxima and minima, and some closures of NP","volume":"51","author":"Wagner","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(98)00024-6_BIB23","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1137\/0219058","article-title":"Bounded query classes","volume":"19","author":"Wagner","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(98)00024-6_BIB24","series-title":"Proc. of the Conference of Foundations on Computation Theory","first-page":"485","article-title":"On the boolean closure of NP, manuscript","volume":"Vol. 199","author":"Wechsung","year":"1985"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000246?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000246?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T18:53:51Z","timestamp":1555959231000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000246"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0020019098000246"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00024-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}