{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:01:38Z","timestamp":1648980098207},"reference-count":22,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3643,"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":[[2003,9]]},"DOI":"10.1016\/s0304-3975(03)00262-7","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"177-194","source":"Crossref","is-referenced-by-count":1,"title":["Almost complete sets"],"prefix":"10.1016","volume":"306","author":[{"given":"Klaus","family":"Ambos-Spies","sequence":"first","affiliation":[]},{"given":"Wolfgang","family":"Merkle","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Reimann","sequence":"additional","affiliation":[]},{"given":"Sebastiaan A.","family":"Terwijn","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00262-7_BIB1","doi-asserted-by":"crossref","unstructured":"E. Allender, M. Strauss, Measure on small complexity classes with applications for BPP, in: Proc. 35th Annu. IEEE Symp. on Foundations of Computer Science, IEEE Computer Society Press, Silver Spring, MD, 1994, pp. 807\u2013818.","DOI":"10.1109\/SFCS.1994.365713"},{"key":"10.1016\/S0304-3975(03)00262-7_BIB2","doi-asserted-by":"crossref","unstructured":"K. Ambos-Spies, Measure theoretic completeness notions for the exponential time classes, in: Mathematical Foundations of Computer Science 2000, 25th Internat. Symp., MFCS 2000, Lecture Notes in Computer Science, Vol. 1893, Springer, Berlin, 2000, pp. 152\u2013161.","DOI":"10.1007\/3-540-44612-5_11"},{"key":"10.1016\/S0304-3975(03)00262-7_BIB3","doi-asserted-by":"crossref","unstructured":"K. Ambos-Spies, S. Lempp, G. Mainhardt, Randomness vs. completeness: on the diagonalization strength of resource bounded random sets, in: Mathematical Foundations of Computer Science 1998, 23rd Internat. Symp., MFCS 1998, Lecture Notes in Computer Science, Vol. 1450, Springer, Berlin, 1998, pp. 465\u2013473.","DOI":"10.1007\/BFb0055796"},{"key":"10.1016\/S0304-3975(03)00262-7_BIB4","series-title":"Complexity, Logic, and Recursion Theory","first-page":"1","article-title":"Resource-bounded measure and randomness","author":"Ambos-Spies","year":"1997"},{"key":"10.1016\/S0304-3975(03)00262-7_BIB5","doi-asserted-by":"crossref","unstructured":"K. Ambos-Spies, E. Mayordomo, X. Zheng, A comparison of weak completeness notions, in: Proc. 11th Annu. IEEE Conf. on Computational Complexity, IEEE Computer Society Press, Silver Spring, MD, 1996, pp. 171\u2013178.","DOI":"10.1109\/CCC.1996.507679"},{"key":"10.1016\/S0304-3975(03)00262-7_BIB6","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(96)89424-2","article-title":"Genericity and measure for exponential time","volume":"168","author":"Ambos-Spies","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00262-7_BIB7","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0304-3975(95)00260-X","article-title":"Resource bounded randomness and weakly complete problems","volume":"172","author":"Ambos-Spies","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00262-7_BIB8","doi-asserted-by":"crossref","unstructured":"J.L. Balc\u00e1zar, J. D\u0131́az, J. Gabarr\u00f3, Structural Complexity, Vol. I, Springer, Berlin, 1995.","DOI":"10.1007\/978-3-642-79235-9"},{"key":"10.1016\/S0304-3975(03)00262-7_BIB9","unstructured":"L. Berman. Polynomial Reducibilities and Complete Sets, Ph.D. Thesis, Cornell University, 1977."},{"key":"10.1016\/S0304-3975(03)00262-7_BIB10","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1137\/S0097539798343891","article-title":"A generalization of resource bounded measure, with application to the BPP vs. EXP problem","volume":"30","author":"Buhrman","year":"2000","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(03)00262-7_BIB11","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0304-3975(93)90126-E","article-title":"On 1-truth-table-hard languages","volume":"115","author":"Homer","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00262-7_BIB12","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF01206322","article-title":"Weakly complete problems are not rare","volume":"5","author":"Juedes","year":"1995","journal-title":"Comput. Complexity"},{"key":"10.1016\/S0304-3975(03)00262-7_BIB13","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1137\/S0097539792238133","article-title":"The complexity and distribution of hard problems","volume":"24","author":"Juedes","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(03)00262-7_BIB14","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0304-3975(95)80030-D","article-title":"Weak completeness in E and E2","volume":"143","author":"Juedes","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00262-7_BIB15","series-title":"The Graph Isomorphism Problem","author":"K\u00f6bler","year":"1993"},{"key":"10.1016\/S0304-3975(03)00262-7_BIB16","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\/S0304-3975(03)00262-7_BIB17","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1137\/S0097539793249700","article-title":"Weakly hard problems","volume":"24","author":"Lutz","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(03)00262-7_BIB18","series-title":"Complexity Theory Retrospective II","first-page":"225","article-title":"The quantitative structure of exponential time","author":"Lutz","year":"1997"},{"key":"10.1016\/S0304-3975(03)00262-7_BIB19","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\/S0304-3975(03)00262-7_BIB20","unstructured":"K.W. Regan, D. Sivakumar, Improved resource-bounded Borel-Cantelli and stochasticity theorems, Tech. Rep. UBCS-TR 95-08, Department of Computer Science, State University of New York at Buffalo, 1995."},{"key":"10.1016\/S0304-3975(03)00262-7_BIB21","doi-asserted-by":"crossref","unstructured":"K.W. Regan, D. Sivakumar, J.-Y. Cai, Pseudorandom generators, measure theory, and natural proofs, in: Proc. 36th Annu. IEEE Symp. on Foundations of Computer Science, IEEE Computer Society Press, Silver Spring, MD, 1995, pp. 26\u201335.","DOI":"10.1109\/SFCS.1995.492459"},{"key":"10.1016\/S0304-3975(03)00262-7_BIB22","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0304-3975(87)90132-0","article-title":"A comparison of polynomial time completeness notions","volume":"54","author":"Watanabe","year":"1987","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503002627?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503002627?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T15:27:00Z","timestamp":1553182020000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503002627"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":22,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0304397503002627"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00262-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}