{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T15:40:23Z","timestamp":1704210023740},"reference-count":54,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,11,1]],"date-time":"1994-11-01T00:00:00Z","timestamp":783648000000},"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":6833,"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":[[1994,11]]},"DOI":"10.1016\/0304-3975(94)00016-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:32Z","timestamp":1027655252000},"page":"263-285","source":"Crossref","is-referenced-by-count":15,"title":["Locating P\/poly optimally in the extended low hierarchy"],"prefix":"10.1016","volume":"134","author":[{"given":"J.","family":"K\u00f6bler","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00016-6_BIB1","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1145\/147508.147546","article-title":"Lower bounds for the low hierarchy","volume":"39","author":"Allender","year":"1992","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)00016-6_BIB2","series-title":"Proc. 5th Structure in Complexity Theory Conf.","first-page":"232","article-title":"Some connections between bounded query classes and non-uniform complexity","author":"Amir","year":"1990"},{"key":"10.1016\/0304-3975(94)00016-6_BIB3","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00116828","article-title":"Queries and concept learning","volume":"2","author":"Angluin","year":"1988","journal-title":"Mach. Learning"},{"key":"10.1016\/0304-3975(94)00016-6_BIB4","doi-asserted-by":"crossref","unstructured":"V. Arvind, J. K\u00f6bler and M. Mundhenk, Upper bounds on the complexity of sparse and tally descriptions, Math. Systems Theory, to appear.","DOI":"10.1007\/s002240000006"},{"key":"10.1016\/0304-3975(94)00016-6_BIB5","first-page":"679","article-title":"Sparse sets, lowness and highness","volume":"23","author":"Balc\u00e1zar","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)00016-6_BIB6","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/BF00264313","article-title":"Sets with small generalized Kolmogorov complexity","volume":"23","author":"Balc\u00e1zar","year":"1986","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(94)00016-6_BIB7","series-title":"Structural Complexity Theory","author":"Balc\u00e1zar","year":"1990"},{"key":"10.1016\/0304-3975(94)00016-6_BIB8","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\/0304-3975(94)00016-6_BIB9","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","article-title":"On isomorphism and density of NP and other complexity classes","volume":"6","author":"Berman","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)00016-6_BIB10","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/S0019-9958(74)90473-2","article-title":"Tally languages and complexity classes","volume":"26","author":"Book","year":"1974","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(94)00016-6_BIB11","series-title":"Proc. 8th Structure in Complexity Theory Conf.","first-page":"208","article-title":"SPARSE reduces conjunctively to TALLY","author":"Buhrman","year":"1993"},{"key":"10.1016\/0304-3975(94)00016-6_BIB12","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0890-5401(91)90075-D","article-title":"On truth-table reducibility to SAT","volume":"91","author":"Buss","year":"1991","journal-title":"Inform. Comput."},{"key":"10.1016\/0304-3975(94)00016-6_BIB13","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(94)00016-6_BIB14","series-title":"Tech. Report LSI-92-16-R","article-title":"The \u03b8-operator and the low hierarchy","author":"Castro","year":"1992"},{"key":"10.1016\/0304-3975(94)00016-6_BIB15","series-title":"Doctoral Dissertation","article-title":"Kolmogorov randomness and its applications to structural complexity theory","author":"Gavald\u00e0","year":"1992"},{"key":"10.1016\/0304-3975(94)00016-6_BIB16","series-title":"Proc. 7th Structure in Complexity Theory Conf.","first-page":"249","article-title":"Bounding the complexity of advice functions","author":"Gavald\u00e0","year":"1992"},{"issue":"1","key":"10.1016\/0304-3975(94)00016-6_BIB17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(91)90070-I","article-title":"Strong and robustly strong polynomial time reducibilities to sparse sets","volume":"88","author":"Gavald\u00e0","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00016-6_BIB18","series-title":"Proc. 6th Structure in Complexity Theory Conf.","first-page":"89","article-title":"On the computational complexity of small descriptions","author":"Gavald\u00e0","year":"1991"},{"key":"10.1016\/0304-3975(94)00016-6_BIB19","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0020-0190(83)90024-8","article-title":"On sparse sets in NP-P","volume":"16","author":"Hartmanis","year":"1983","journal-title":"Inform. Proc. Lett."},{"key":"10.1016\/0304-3975(94)00016-6_BIB20","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0304-3975(84)90111-7","article-title":"Computation times of NP sets of different densities","volume":"34","author":"Hartmanis","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00016-6_BIB21","first-page":"110","article-title":"The strong exponential hierarchy collapses","author":"Hemachandra","year":"1987","journal-title":"Proc. 19th ACM Symp. Theory of Computing"},{"key":"10.1016\/0304-3975(94)00016-6_BIB22","author":"Hemachandra","year":"1993","journal-title":"Personal communication"},{"key":"10.1016\/0304-3975(94)00016-6_BIB23","series-title":"Proc. 7th Structure in Complexity Theory Conf.","first-page":"222","article-title":"How hard are sparse sets","author":"Hemachandra","year":"1992"},{"key":"10.1016\/0304-3975(94)00016-6_BIB24","series-title":"Doctoral Dissertation","article-title":"Restricted Turing reducibilities and the structure of the polynomial time hierarchy","author":"Kadin","year":"1988"},{"key":"10.1016\/0304-3975(94)00016-6_BIB25","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/0022-0000(89)90024-X","article-title":"PNP[log n] and sparse Turing-complete sets for NP","volume":"39","author":"Kadin","year":"1989","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"10.1016\/0304-3975(94)00016-6_BIB26","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0304-3975(91)90185-5","article-title":"Non-uniform proof systems: a new framework to describe non-uniform and probabilistic complexity classes","volume":"85","author":"K\u00e4mper","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00016-6_BIB27","first-page":"302","article-title":"Some connections between nonuniform and uniform complexity classes","author":"Karp","year":"1980","journal-title":"Proc. 12th ACM Symp. Theory of Computer Science"},{"key":"10.1016\/0304-3975(94)00016-6_BIB28","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1137\/0214003","article-title":"On circuit-size complexity and the low hierarchy in NP","volume":"14","author":"Ko","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)00016-6_BIB29","series-title":"Doctoral Dissertation","article-title":"Strukturelle Komplexit\u00e4t von Anzahlproblemen","author":"K\u00f6bler","year":"1989"},{"key":"10.1016\/0304-3975(94)00016-6_BIB30","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 Inform."},{"key":"10.1016\/0304-3975(94)00016-6_BIB31","doi-asserted-by":"crossref","unstructured":"J. K\u00f6bler and T. Thierauf, Complexity-restricted advice functions, SIAM J. Comput., to appear.","DOI":"10.1137\/S0097539791200351"},{"key":"10.1016\/0304-3975(94)00016-6_BIB32","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","article-title":"A comparison of polynomial time reducibilities","volume":"1","author":"Ladner","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00016-6_BIB33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(82)90085-8","article-title":"Strong nondeterministic polynomial-time reducibilities","volume":"21","author":"Long","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00016-6_BIB34","series-title":"Tech. Report OSU-CISRC-2\/91-TR6","article-title":"A refinement of the low and high hierarchies","author":"Long","year":"1991"},{"key":"10.1016\/0304-3975(94)00016-6_BIB35","series-title":"Tech. Report MIT\/LCS\/TM-126","article-title":"With what frequency are apparently intractable problems difficult?","author":"Meyer","year":"1979"},{"key":"10.1016\/0304-3975(94)00016-6_BIB36","first-page":"125","article-title":"The equivalence problem for regular expressions with squaring requires exponential time","author":"Meyer","year":"1973","journal-title":"Proc. 13th IEEE Symp. on Switching and Automata Theory"},{"key":"10.1016\/0304-3975(94)00016-6_BIB37","doi-asserted-by":"crossref","unstructured":"P. Orponen, K. Ko, U. Sch\u00f6ning and O. Watanabe, Instance complexity, J. ACM, to appear.","DOI":"10.1145\/174644.174648"},{"key":"10.1016\/0304-3975(94)00016-6_BIB38","series-title":"Proc. 17th Internat. Symp. on Math. Foundations of Computer Science","first-page":"472","article-title":"On complexity of counting","volume":"Vol. 324","author":"Piotr\u00f3w","year":"1988"},{"key":"10.1016\/0304-3975(94)00016-6_BIB39","series-title":"Proc. 20th Symp. Foundations of Computer Science","first-page":"307","article-title":"On simultaneous resource bounds","author":"Pippenger","year":"1979"},{"key":"10.1016\/0304-3975(94)00016-6_BIB40","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0204018","article-title":"Every prime has a succinct certificate","volume":"4","author":"Pratt","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)00016-6_BIB41","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0022-0000(83)90027-2","article-title":"A low hierarchy within NP","volume":"27","author":"Sch\u00f6ning","year":"1983","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(94)00016-6_BIB42","article-title":"Complexity and Structure","volume":"Vol. 211","author":"Sch\u00f6ning","year":"1986"},{"key":"10.1016\/0304-3975(94)00016-6_BIB43","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01704904","article-title":"Complete sets and closeness to complexity classes","volume":"19","author":"Sch\u00f6ning","year":"1986","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(94)00016-6_BIB44","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/0022-0000(88)90010-4","article-title":"Graph isomorphism is in the low hierarchy","volume":"37","author":"Sch\u00f6ning","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(94)00016-6_BIB45","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01744288","article-title":"P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP","volume":"13","author":"Selman","year":"1979","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(94)00016-6_BIB46","series-title":"Proc. 9th Symp. on Theoretical Aspects of Computer Science","first-page":"187","article-title":"The extended low hierarchy is an infinite hierarchy","volume":"Vol. 577","author":"Sheu","year":"1992"},{"key":"10.1016\/0304-3975(94)00016-6_BIB47","first-page":"330","article-title":"A complexity theoretic approach to randomness","author":"Sipser","year":"1983","journal-title":"Proc. 15th ACM Symp. Theory of Computer Science"},{"key":"10.1016\/0304-3975(94)00016-6_BIB48","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":"1971","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00016-6_BIB49","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(94)00016-6_BIB50","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)00016-6_BIB51","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\/0304-3975(94)00016-6_BIB52","series-title":"Proc. 17th Internat. Symp. on Math. Foundations of Computer Science","first-page":"82","article-title":"On the complexity of small descriptions and related topics","volume":"Vol. 629","author":"Watanabe","year":"1992"},{"key":"10.1016\/0304-3975(94)00016-6_BIB53","series-title":"Tech. Report 92TR-0004","article-title":"Structural analysis of polynomial time query learnability","author":"Watanabe","year":"1992"},{"key":"10.1016\/0304-3975(94)00016-6_BIB54","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":"Wrathall","year":"1977","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594000166?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594000166?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T15:13:46Z","timestamp":1704208426000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594000166"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,11]]},"references-count":54,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,11]]}},"alternative-id":["0304397594000166"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00016-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,11]]}}}