{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T16:20:54Z","timestamp":1649002854754},"reference-count":41,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"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":6376,"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":[[1996,2]]},"DOI":"10.1016\/0304-3975(95)00066-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:42:52Z","timestamp":1027611772000},"page":"307-327","source":"Crossref","is-referenced-by-count":5,"title":["Effective category and measure in abstract complexity theory"],"prefix":"10.1016","volume":"154","author":[{"given":"Cristian","family":"Calude","sequence":"first","affiliation":[]},{"given":"Marius","family":"Zimand","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00066-6_BIB1","series-title":"FOCS'94","first-page":"807","article-title":"Measure on small complexity classes, with applications for BPP","author":"Allender","year":"1994"},{"issue":"2","key":"10.1016\/0304-3975(95)00066-6_BIB2","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","article-title":"A machine-independent theory of the complexity of recursive functions","volume":"14","author":"Blum","year":"1967","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/0304-3975(95)00066-6_BIB3","first-page":"257","article-title":"On effective procedures for speeding up algorithms","volume":"18","author":"Blum","year":"1967","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/0304-3975(95)00066-6_BIB4","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321679.321691","article-title":"Computational complexity and the existence of complexity gaps","volume":"19","author":"Borodin","year":"1972","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(95)00066-6_BIB5","author":"Bridges","year":"1994"},{"key":"10.1016\/0304-3975(95)00066-6_BIB6","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0304-3975(94)00050-6","article-title":"On recursive bounds for the exceptional values in speed-up","volume":"132","author":"Bridges","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00066-6_BIB7","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(95)00066-6_BIB8","series-title":"Theories of Computational Complexity","author":"Calude","year":"1988"},{"key":"10.1016\/0304-3975(95)00066-6_BIB9","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0304-3975(91)90331-U","article-title":"Relativized topological size of sets of partial recursive functions","volume":"87","author":"Calude","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00066-6_BIB10","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1002\/malq.19920380112","article-title":"Recursive Baire classification and speedable functions","volume":"3","author":"Calude","year":"1992","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/0304-3975(95)00066-6_BIB11","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0096-3003(94)90158-9","article-title":"Is independence an exception?","volume":"66","author":"Calude","year":"1994","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/0304-3975(95)00066-6_BIB12","series-title":"Abstracts of the Second International Colloquium on Semigroups, Formal Languages and Combinatorics on Words","first-page":"11","article-title":"On three theorems in abstract complexity theory: A topological glimpse","author":"Calude","year":"1992"},{"issue":"1","key":"10.1016\/0304-3975(95)00066-6_BIB13","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1145\/321679.321692","article-title":"The operator gap","volume":"19","author":"Constable","year":"1972","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(95)00066-6_BIB14","series-title":"Proc. 6th Structure in Complexity Theory","first-page":"347","article-title":"Notions of resource-bounded category and genericity","author":"Fenner","year":"1991"},{"key":"10.1016\/0304-3975(95)00066-6_BIB15","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/BF01084088","article-title":"Families of recursive predicates of measure zero","volume":"6","author":"Freidzon","year":"1976","journal-title":"J. Soviet Math."},{"key":"10.1016\/0304-3975(95)00066-6_BIB16","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1016\/0022-0000(90)90006-7","article-title":"A note on a.e. h-complex functions","volume":"40","author":"Fulk","year":"1990","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/0304-3975(95)00066-6_BIB17","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1145\/321650.321661","article-title":"An overview of the theory of computational complexity","volume":"18","author":"Hartmanis","year":"1971","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(95)00066-6_BIB18","doi-asserted-by":"crossref","first-page":"21","DOI":"10.2307\/2271512","article-title":"On size vs. efficiency for programs admitting speed-ups","volume":"36","author":"Helm","year":"1971","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(95)00066-6_BIB19","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(95)00066-6_BIB20","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/0022-0000(92)90020-J","article-title":"Almost everywhere high nonuniform complexity","volume":"44","author":"Lutz","year":"1992","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00066-6_BIB21","series-title":"Proceedings of the 8th Structure in Complexity Theory Conference","first-page":"158","article-title":"The quantitative structure of exponential time","author":"Lutz","year":"1993"},{"key":"10.1016\/0304-3975(95)00066-6_BIB22","series-title":"An Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(95)00066-6_BIB23","series-title":"An Introduction to the General Theory of Algorithms","author":"Machtey","year":"1978"},{"key":"10.1016\/0304-3975(95)00066-6_BIB24","unstructured":"S. Marcus, Personal Communication, July 1993."},{"key":"10.1016\/0304-3975(95)00066-6_BIB25","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/0304-3975(94)00023-C","article-title":"Almost every set in exponential time is p-bi-immune","volume":"136","author":"Mayordomo","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00066-6_BIB26","series-title":"Annual IEEE Symp. on Switching and Automata Theory, Univ. Iowa","first-page":"190","article-title":"On the size of sets of computable functions","author":"Mehlhorn","year":"1973"},{"key":"10.1016\/0304-3975(95)00066-6_BIB27","series-title":"Proc. Second ICALP","first-page":"1317","article-title":"The almost all theory of subrecursive degrees is decidable","author":"Melhorn","year":"1974"},{"issue":"1","key":"10.1016\/0304-3975(95)00066-6_BIB28","doi-asserted-by":"crossref","first-page":"55","DOI":"10.2307\/2272545","article-title":"Computational speed-up by effective operators","volume":"37","author":"Meyer","year":"1972","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(95)00066-6_BIB29","series-title":"Conf. Rec. ACM Symp. on Theory of Computing","first-page":"79","article-title":"Classes of computable functions defined by bounds on computation: preliminary report","author":"McCreight","year":"1965"},{"key":"10.1016\/0304-3975(95)00066-6_BIB30","first-page":"97","article-title":"The fundamental theorem of complexity theory","volume":"Vol. 108","author":"Meyer","year":"1979"},{"key":"10.1016\/0304-3975(95)00066-6_BIB31","article-title":"Degree of difficulty of computing a function","author":"Rabin","year":"1960"},{"key":"10.1016\/0304-3975(95)00066-6_BIB32","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0304-3975(95)00066-6_BIB33","series-title":"Proc. First Internat. Conf. on Automata, Languages and Programming","first-page":"589","article-title":"Does the computational speed-up concern programming?","author":"Schnorr","year":"1972"},{"key":"10.1016\/0304-3975(95)00066-6_BIB34","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/S0022-0000(73)80030-3","article-title":"Process complexity and effective random tests","volume":"7","author":"Schnorr","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00066-6_BIB35","first-page":"165","article-title":"Machine-independent complexity theory","volume":"Vol. A","author":"Seiferas","year":"1990"},{"key":"10.1016\/0304-3975(95)00066-6_BIB36","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0168-0072(94)00026-Y","article-title":"Characterization of realizable space complexities","volume":"73","author":"Seiferas","year":"1995","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0304-3975(95)00066-6_BIB37","article-title":"Complexity of Algorithms and Computations","author":"Trakhtenbrot","year":"1967","journal-title":"Course Notes"},{"key":"10.1016\/0304-3975(95)00066-6_BIB38","series-title":"Proc. of the Symp. on Mathematical Foundations of Computer Science","first-page":"232","article-title":"Ten years of speed-up","volume":"Vol. 32","author":"van Emde Boas","year":"1975"},{"key":"10.1016\/0304-3975(95)00066-6_BIB39","first-page":"555","article-title":"Easy constructions in complexity theory: gap and speed-up theorems","volume":"37","author":"Young","year":"1973"},{"key":"10.1016\/0304-3975(95)00066-6_BIB40","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(93)90161-L","article-title":"If not empty, NP\/P is topologically large","volume":"119","author":"Zimand","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00066-6_BIB41","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0304-3975(94)00240-J","article-title":"On the topological size of p-m-complete degrees","volume":"147","author":"Zimand","year":"1995","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595000666?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595000666?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T21:57:46Z","timestamp":1556315866000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595000666"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["0304397595000666"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00066-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}