{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:13:49Z","timestamp":1768281229609,"version":"3.49.0"},"reference-count":24,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,10,1]],"date-time":"1993-10-01T00:00:00Z","timestamp":749433600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1993,10,1]],"date-time":"1993-10-01T00:00:00Z","timestamp":749433600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2004,3,31]],"date-time":"2004-03-31T00:00:00Z","timestamp":1080691200000},"content-version":"vor","delay-in-days":3834,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1993,10]]},"DOI":"10.1016\/0304-3975(93)90161-l","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"293-310","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["If not empty, NP \u2014 P is topologically large"],"prefix":"10.1016","volume":"119","author":[{"given":"Marius","family":"Zimand","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90161-L_BIB1","doi-asserted-by":"crossref","first-page":"1193","DOI":"10.1137\/0217075","article-title":"P-printable sets","volume":"17","author":"Allender","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90161-L_BIB2","series-title":"Proc. 1st Conf. Structure in Complexity Theory","first-page":"23","article-title":"Randomness, relativizations and polynomial reducibilities","volume":"Vol. 223","author":"Ambos-Spies","year":"1986"},{"key":"10.1016\/0304-3975(93)90161-L_BIB3","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1137\/0214012","article-title":"Simplicity, relativizations, and nondeterminism","volume":"14","author":"Balcazar","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90161-L_BIB4","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/0020-0190(82)90113-2","article-title":"A note on a theorem of Ladner","volume":"15","author":"Balcazar","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(93)90161-L_BIB5","series-title":"Structural Complexity, Vol. I","author":"Balcazar","year":"1988"},{"key":"10.1016\/0304-3975(93)90161-L_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01699457","article-title":"Bi-immune sets for complexity classes","volume":"18","author":"Balcazar","year":"1985","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(93)90161-L_BIB7","series-title":"Tech. Report","article-title":"Comparing complexity classes: some observations on intrinsic characterizations, restricted relativizations, and uniform witnesses","author":"Book","year":"1989"},{"key":"10.1016\/0304-3975(93)90161-L_BIB8","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1002\/malq.19820282707","article-title":"Topological size of sets of partial recursive functions","volume":"28","author":"Calude","year":"1982","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/0304-3975(93)90161-L_BIB9","series-title":"Theories of Computational Complexity","author":"Calude","year":"1988"},{"key":"10.1016\/0304-3975(93)90161-L_BIB10","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90161-L_BIB11","first-page":"440","article-title":"Compression and ranking","author":"Goldberg","year":"1985","journal-title":"Proc. 25th Ann. ACM STOC"},{"key":"10.1016\/0304-3975(93)90161-L_BIB12","first-page":"117","article-title":"On the importance of being \u03c02-hard","volume":"37","author":"Hartmanis","year":"1989","journal-title":"Bull. EATCS"},{"key":"10.1016\/0304-3975(93)90161-L_BIB13","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0020-0190(85)90026-2","article-title":"Independence results about context-free languages and lower bounds","volume":"20","author":"Hartmanis","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(93)90161-L_BIB14","first-page":"136","article-title":"Containment, separation, complete sets, and immunity of complexity classes","volume":"Vol. 226","author":"Hartmanis","year":"1986"},{"key":"10.1016\/0304-3975(93)90161-L_BIB15","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/321864.321877","article-title":"On the structure of polynomial time reducibility","volume":"22","author":"Ladner","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90161-L_BIB16","doi-asserted-by":"crossref","first-page":"1100","DOI":"10.1137\/0219076","article-title":"Category and measure in complexity classes","volume":"19","author":"Lutz","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90161-L_BIB17","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/SWAT.1973.23","article-title":"On the size of sets of computable functions","author":"Mehlhorn","year":"1973","journal-title":"Proc. Ann. IEEE Symp. on Switching and Automata Theory"},{"key":"10.1016\/0304-3975(93)90161-L_BIB18","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0304-3975(93)90161-L_BIB19","article-title":"Complexity and Structure","volume":"Vol. 211","author":"Sch\u00f6ning","year":"1985"},{"key":"10.1016\/0304-3975(93)90161-L_BIB20","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0022-0000(83)90027-2","article-title":"A low and a high hierarchy within NP","volume":"27","author":"Sch\u00f6ning","year":"1983","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0304-3975(93)90161-L_BIB21","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/0213023","article-title":"Immunity, relativizations, and nondeterminism","volume":"13","author":"Sch\u00f6ning","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90161-L_BIB22","series-title":"Recursively Enumerable Sets and Degrees","author":"Soare","year":"1987"},{"key":"10.1016\/0304-3975(93)90161-L_BIB23_1","series-title":"Ph.D. Thesis","article-title":"Structural complexity theory: positive relativization and Baire classification","author":"Zimand","year":"1991"},{"key":"10.1016\/0304-3975(93)90161-L_BIB23_2","first-page":"475","article-title":"Structural complexity theory: positive relativization and Baire classification","volume":"45","author":"Zimand","year":"1991","journal-title":"Bull. EATCS"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390161L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390161L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:18:30Z","timestamp":1757477910000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390161L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,10]]}},"alternative-id":["030439759390161L"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90161-l","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"If not empty, NP \u2014 P is topologically large","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(93)90161-L","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1993 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}