{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T00:12:35Z","timestamp":1704154355215},"reference-count":44,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,4,1]],"date-time":"1995-04-01T00:00:00Z","timestamp":796694400000},"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":6682,"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":[[1995,4]]},"DOI":"10.1016\/0304-3975(94)00080-3","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"175-193","source":"Crossref","is-referenced-by-count":33,"title":["Computing functions with parallel queries to NP"],"prefix":"10.1016","volume":"141","author":[{"given":"Birgit","family":"Jenner","sequence":"first","affiliation":[]},{"given":"Jacobo","family":"Tor\u00e1n","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00080-3_BIB1","series-title":"Proc. 9th Structure in Complexity Theory Conference","first-page":"24","article-title":"Polynomial time truth-table reductions to p-selective sets","author":"Agarwal","year":"1994"},{"key":"10.1016\/0304-3975(94)00080-3_BIB2","series-title":"Proc. 5th IEEE Structure in Complexity Theory Conference","first-page":"112","article-title":"Width-bounded reducibility and binary search over complexity classes","author":"Allender","year":"1990"},{"key":"10.1016\/0304-3975(94)00080-3_BIB3_1","series-title":"Proc. 8th STACS Conf.","first-page":"422","article-title":"Functional oracle queries as a measue of parallel time","volume":"Vol. 480","author":"\u00c0lvarez","year":"1991"},{"key":"10.1016\/0304-3975(94)00080-3_BIB3_2","unstructured":"a journal version is to appear as: Adaptive logspace reducibiity and parallel time, Math. Systems Theory."},{"key":"10.1016\/0304-3975(94)00080-3_BIB4","article-title":"NP-hard sets are p-superterse unless R = NP","author":"Beigel","year":"1988"},{"key":"10.1016\/0304-3975(94)00080-3_BIB5","series-title":"Proc. 9th Structure in Complexity Theory Conf.","first-page":"12","article-title":"Approximable sets","author":"Beigel","year":"1994"},{"key":"10.1016\/0304-3975(94)00080-3_BIB6","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/S0019-9958(82)90439-9","article-title":"On the unique satisfiability problem","volume":"55","author":"Blass","year":"1982","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(94)00080-3_BIB7","series-title":"Proc. 9th Structure in Complexity Theory Conf.","first-page":"43","article-title":"On functions computable with nonadaptive queries to NP","author":"Buhrman","year":"1994"},{"key":"10.1016\/0304-3975(94)00080-3_BIB8","series-title":"Proc. 3rd IEEE Structure in Complexity Conf.","first-page":"224","article-title":"On thruth-table reducibility to SAT and the difference hierarchy over NP","author":"Buss","year":"1988"},{"key":"10.1016\/0304-3975(94)00080-3_BIB9","unstructured":"S.R. Buss, J. Krajicek and G. Takeuti, Provably total functions in bounded arithmetic theories R3i, U2i and V2i, in: P. Clote and J. Krajicek, eds., Arithmetic, Proof Theory and Computational Complexity (Oxford University Press, Oxford) to appear."},{"key":"10.1016\/0304-3975(94)00080-3_BIB10","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/0890-5401(89)90063-1","article-title":"Enumerative counting is hard","volume":"82","author":"Cai","year":"1989","journal-title":"Inform. Comput."},{"key":"10.1016\/0304-3975(94)00080-3_BIB11","series-title":"Proc. 9th STACS","first-page":"305","article-title":"Characterizations of some complexity classes between \u03982p and \u03942p","volume":"Vol. 577","author":"Castro","year":"1992"},{"issue":"2","key":"10.1016\/0304-3975(94)00080-3_BIB12","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\/0304-3975(94)00080-3_BIB13","unstructured":"Z.Z. Chen and S. Toda, On the complexity of computing the minimum subgraph, submitted."},{"key":"10.1016\/0304-3975(94)00080-3_BIB14","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF02090764","article-title":"Classes of bounded nondeterminism","volume":"23","author":"D\u00edaz","year":"1990","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(94)00080-3_BIB15","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/S0019-9958(84)80056-X","article-title":"The complexity of promise problems with applications to public-key cryptography","volume":"61","author":"Even","year":"1984","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(94)00080-3_BIB16","series-title":"Proc. 7th IEEE Structure in Complexity Theory Conf.","first-page":"107","article-title":"Self-witnessing polynomial-time complexity and prime factorization","author":"Fellows","year":"1992"},{"key":"10.1016\/0304-3975(94)00080-3_BIB17","series-title":"Proc. 10th STACS","first-page":"398","article-title":"On using oracles that compute values","volume":"Vol. 665","author":"Fenner","year":"1993"},{"key":"10.1016\/0304-3975(94)00080-3_BIB18","article-title":"The sky is falling: The strong exponential hierarchy collapses","author":"Hemachandra","year":"1986"},{"key":"10.1016\/0304-3975(94)00080-3_BIB19","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0890-5401(89)90012-6","article-title":"The logarithmic alternation hierarchy collapses A\u03a32L = A\u03a02L","volume":"1","author":"Jenner","year":"1989","journal-title":"Inform. Comput."},{"issue":"3","key":"10.1016\/0304-3975(94)00080-3_BIB20","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","article-title":"Approximation algorithms for combinatorial problems","volume":"9","author":"Johnson","year":"1974","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0304-3975(94)00080-3_BIB21","series-title":"Proc. 2nd IEEE Structure in Complexity Theory Conf.","first-page":"33","article-title":"PNP[log] and sparse Turing-complete sets for NP","author":"Kadin","year":"1987"},{"key":"10.1016\/0304-3975(94)00080-3_BIB22","first-page":"129","article-title":"Refining nondeterminism in relativized complexity classes","volume":"13","author":"Kintala","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)00080-3_BIB23","unstructured":"J. K\u00f6bler, personal communication, Ulm, 1991."},{"key":"10.1016\/0304-3975(94)00080-3_BIB24","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF00276023","article-title":"On counting and approximation","volume":"26","author":"K\u00f6bler","year":"1989","journal-title":"Acta Informatica"},{"key":"10.1016\/0304-3975(94)00080-3_BIB25","series-title":"The Graph Isomorphism Problem, its Structural Complexity","author":"K\u00f6bler","year":"1993"},{"key":"10.1016\/0304-3975(94)00080-3_BIB26","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/0022-0000(88)90039-6","article-title":"The complexity of optimization problems","volume":"36","author":"Krentel","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(94)00080-3_BIB27","doi-asserted-by":"crossref","unstructured":"R.E. Ladner, The circuit value problem is log space complete for P.SIGACT NEWS 7, pp. 18\u201320.","DOI":"10.1145\/990518.990519"},{"key":"10.1016\/0304-3975(94)00080-3_BIB28","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01683260","article-title":"Relativization of questions about log space computability","volume":"10","author":"Ladner","year":"1976","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(94)00080-3_BIB29","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","article-title":"Comparison of polynomial-time reducibilities","volume":"1","author":"Ladner","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00080-3_BIB30","article-title":"Parallel versus logarithmic many queries to NP","author":"Lozano","year":"1993"},{"key":"10.1016\/0304-3975(94)00080-3_BIB31","series-title":"Proc. 7nd IEEE Structure in Complexity Theory Conf.","first-page":"118","article-title":"On the non-uniform complexity of the graph isomorphism problem","author":"Lozano","year":"1992"},{"key":"10.1016\/0304-3975(94)00080-3_BIB32","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0020-0190(79)90004-8","article-title":"A note on the graph isomorphism counting problem","volume":"8","author":"Mathon","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(94)00080-3_BIB33","series-title":"Proc. 9th Structure in Complexity Theory Conf.","first-page":"2","article-title":"Polynomial-time membership comparable sets","author":"Ogiwara","year":"1994"},{"key":"10.1016\/0304-3975(94)00080-3_BIB34","series-title":"Proc. 8th IEEE Structure in Complexity Theory Conf.","first-page":"12","article-title":"On limited nondeterminism and the complexity of the VC-dimension","author":"Papadimitriou","year":"1993"},{"issue":"2","key":"10.1016\/0304-3975(94)00080-3_BIB35","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/S0022-0000(05)80009-1","article-title":"A taxonomy of complexity classes of functions","volume":"48","author":"Selman","year":"1994","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(94)00080-3_BIB36","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1137\/0212037","article-title":"Positive relativizations of complexity classes","volume":"12","author":"Selman","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)00080-3_BIB37","series-title":"Proc. 8th Structure in Complexity Conference","author":"Thierauf","year":"1993"},{"key":"10.1016\/0304-3975(94)00080-3_BIB38","series-title":"Proc. 11th STACS Conf.","first-page":"427","article-title":"On sets bounded truth-table reducible to P-selective sets","volume":"Vol. 775","author":"Thierauf","year":"1994"},{"issue":"2","key":"10.1016\/0304-3975(94)00080-3_BIB39","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF02090391","article-title":"On polynomial-time truth-reducibilities of intractable sets to P-selective sets","volume":"24","author":"Toda","year":"1991","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(94)00080-3_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."},{"key":"10.1016\/0304-3975(94)00080-3_BIB41","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(86)90135-0","article-title":"NP is as easy as detecting unique solutions","volume":"47","author":"Valiant","year":"1986","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"10.1016\/0304-3975(94)00080-3_BIB42","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."},{"issue":"2","key":"10.1016\/0304-3975(94)00080-3_BIB43","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1137\/0219024","article-title":"Decomposing AC and NC","volume":"19","author":"Wilson","year":"1990","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594000803?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594000803?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T23:44:44Z","timestamp":1704152684000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594000803"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,4]]},"references-count":44,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,4]]}},"alternative-id":["0304397594000803"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00080-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,4]]}}}