{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:54:00Z","timestamp":1757627640646,"version":"3.44.0"},"reference-count":17,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,8,1]],"date-time":"1995-08-01T00:00:00Z","timestamp":807235200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,8,1]],"date-time":"1995-08-01T00:00:00Z","timestamp":807235200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1999,12,22]],"date-time":"1999-12-22T00:00:00Z","timestamp":945820800000},"content-version":"vor","delay-in-days":1604,"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":[[1995,8]]},"DOI":"10.1016\/0304-3975(94)00240-j","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"137-147","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the topological size of p-m-complete degrees"],"prefix":"10.1016","volume":"147","author":[{"given":"Marius","family":"Zimand","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00240-J_BIB1","series-title":"Proc. 34th IEEE Symp. on Foundations of Computer Science","article-title":"Measure on small complexity classes, with applications for BPP","author":"Allender","year":"1994"},{"key":"10.1016\/0304-3975(94)00240-J_BIB2","series-title":"Abstracts of the 2nd Internat. Colloq. on Words, Languages and Combinatorics","first-page":"11","article-title":"On three theorems in abstract complexity theory: a topological glimpse","author":"Calude","year":"1992"},{"year":"1993","author":"Calude","key":"10.1016\/0304-3975(94)00240-J_BIB3"},{"key":"10.1016\/0304-3975(94)00240-J_BIB4","series-title":"Proc. 6th Structure in Complexity Theory Conf.","first-page":"347","article-title":"Notions of resource-bounded category and genericity","author":"Fenner","year":"1991"},{"issue":"2","key":"10.1016\/0304-3975(94)00240-J_BIB5","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(90)90138-8","article-title":"Robust machines accept easy sets","volume":"74","author":"Hartmanis","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00240-J_BIB6","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0022-0000(92)90023-C","article-title":"Oracles for structural properties: the isomorphism problem and public-key cryptography","volume":"44","author":"Homer","year":"1992","journal-title":"J. Comput. System Sci."},{"year":"1979","series-title":"introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","key":"10.1016\/0304-3975(94)00240-J_BIB7"},{"key":"10.1016\/0304-3975(94)00240-J_BIB8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(85)90140-9","article-title":"Some remarks on witness functions for non-polynomial and non-complete sets in NP","volume":"39","author":"Joseph","year":"1985","journal-title":"Theoret. Comput. Sci."},{"year":"1983","series-title":"A relativized failure of the Berman-Hartmanis conjecture","author":"Kurtz","key":"10.1016\/0304-3975(94)00240-J_BIB9"},{"year":"1988","author":"Kurtz","key":"10.1016\/0304-3975(94)00240-J_BIB10"},{"key":"10.1016\/0304-3975(94)00240-J_BIB11","series-title":"Proc. 21st ACM Symp. on Theory of Computing","first-page":"157","article-title":"The isomorphism conjecture fails relative to a random oracle","author":"Kurtz","year":"1989"},{"key":"10.1016\/0304-3975(94)00240-J_BIB12","series-title":"Complexity Theory Retrospective","first-page":"108","article-title":"The structure of complete degrees","author":"Kurtz","year":"1990"},{"issue":"6","key":"10.1016\/0304-3975(94)00240-J_BIB13","doi-asserted-by":"crossref","first-page":"1100","DOI":"10.1137\/0219076","article-title":"Category and measure in complexity theory","volume":"19","author":"Lutz","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)00240-J_BIB14","series-title":"Proc. 8th Structure in Complexity Theory Conf.","first-page":"158","article-title":"The quantitative structure of exponential time","author":"Lutz","year":"1993"},{"key":"10.1016\/0304-3975(94)00240-J_BIB15","series-title":"Proc. 17th Symp. on Mathematical Foundations of Computer Science","first-page":"392","article-title":"Almost every set in exponential time is p-bi-immune","volume":"vol. 629","author":"Mayordomo","year":"1992"},{"key":"10.1016\/0304-3975(94)00240-J_BIB16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(91)90045-4","article-title":"On p-creative sets and p-completely creative sets","volume":"85","author":"Wang","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00240-J_BIB17","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(93)90161-L","article-title":"If not empty, NP \u2014 P is topologically large","volume":"119","author":"Zimand","year":"1993","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400240J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400240J?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:17:45Z","timestamp":1757477865000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759400240J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,8]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,8]]}},"alternative-id":["030439759400240J"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00240-j","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1995,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the topological size of p-m-complete degrees","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(94)00240-J","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1995 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}