{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T09:18:14Z","timestamp":1648631894563},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,12,2]],"date-time":"2011-12-02T00:00:00Z","timestamp":1322784000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s00224-011-9370-3","type":"journal-article","created":{"date-parts":[[2011,12,2]],"date-time":"2011-12-02T09:57:17Z","timestamp":1322819837000},"page":"106-122","source":"Crossref","is-referenced-by-count":2,"title":["Comparing Nontriviality for E and EXP"],"prefix":"10.1007","volume":"51","author":[{"given":"Klaus","family":"Ambos-Spies","sequence":"first","affiliation":[]},{"given":"Timur","family":"Bakibayev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,12,2]]},"reference":[{"key":"9370_CR1","series-title":"London Math. Soc. Lecture Note Ser.","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/CBO9780511629167.002","volume-title":"Computability, Enumerability, Unsolvability","author":"K. Ambos-Spies","year":"1996","unstructured":"Ambos-Spies, K.: Resource-bounded genericity. In: Computability, Enumerability, Unsolvability. London Math. Soc. Lecture Note Ser., vol.\u00a0224, pp. 1\u201359. Cambridge Univ. Press, Cambridge (1996)"},{"key":"9370_CR2","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/978-3-642-14165-2_43","volume-title":"Proc. ICALP 2010, Part I","author":"K. Ambos-Spies","year":"2010","unstructured":"Ambos-Spies, K., Bakibayev, T.: Weak completeness notions for exponential time. In: Proc. ICALP 2010, Part I. Lecture Notes in Comput. Sci., vol.\u00a06198, pp.\u00a0503\u2013514. Springer, Berlin (2010)"},{"key":"9370_CR3","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1017\/S0960129510000174","volume":"20","author":"K. Ambos-Spies","year":"2010","unstructured":"Ambos-Spies, K., Kr\u00e4ling, T.: Quantitative aspects of speed-up and gap phenomena. Mathematical Structures in Computer Science 20, 707\u2013722 (2010)","journal-title":"Mathematical Structures in Computer Science"},{"key":"9370_CR4","series-title":"Lecture Notes in Pure and Appl. Math.","first-page":"1","volume-title":"Complexity, Logic, and Recursion Theory","author":"K. Ambos-Spies","year":"1997","unstructured":"Ambos-Spies, K., Mayordomo, E.: Resource-bounded measure and randomness. In: Complexity, Logic, and Recursion Theory. Lecture Notes in Pure and Appl. Math., vol.\u00a0187, pp.\u00a01\u201347. Dekker, New York (1997)"},{"key":"9370_CR5","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0304-3975(95)00260-X","volume":"172","author":"K. Ambos-Spies","year":"1997","unstructured":"Ambos-Spies, K., Terwijn, S.A., Zheng, X.: Resource bounded randomness and weakly complete problems. Theoret. Comput. Sci. 172, 195\u2013207 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"9370_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-79235-9","volume-title":"Structural Complexity I","author":"J.L. Balc\u00e1zar","year":"1995","unstructured":"Balc\u00e1zar, J.L., D\u00edaz, J., Gabarr\u00f3, J.: Structural Complexity I, 2nd edn. Springer, Berlin (1995)","edition":"2"},{"key":"9370_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-75357-2","volume-title":"Structural Complexity II","author":"J.L. Balc\u00e1zar","year":"1990","unstructured":"Balc\u00e1zar, J.L., D\u00edaz, J., Gabarr\u00f3, J.: Structural Complexity II. Springer, Berlin (1990)"},{"key":"9370_CR8","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1109\/SFCS.1976.22","volume-title":"17th Annual Symposium on Foundations of Computer Science","author":"L. Berman","year":"1976","unstructured":"Berman, L.: On the structure of complete sets: almost everywhere complexity and infinitely often speedup. In: 17th Annual Symposium on Foundations of Computer Science, pp.\u00a076\u201380. IEEE Comput. Soc., Long Beach (1976)"},{"key":"9370_CR9","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0304-3975(95)80030-D","volume":"143","author":"D.W. Juedes","year":"1995","unstructured":"Juedes, D.W., Lutz, J.H.: Weak completeness in E and E2. Theoret. Comput. Sci. 143, 149\u2013158 (1995)","journal-title":"Theoret. Comput. Sci."},{"key":"9370_CR10","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/0022-0000(92)90020-J","volume":"44","author":"J.H. Lutz","year":"1992","unstructured":"Lutz, J.H.: Almost everywhere high nonuniform complexity. J. Comput. System Sci. 44, 220\u2013258 (1992)","journal-title":"J. Comput. System Sci."},{"key":"9370_CR11","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1137\/S0097539793249700","volume":"24","author":"J.H. Lutz","year":"1995","unstructured":"Lutz, J.H.: Weakly hard problems. SIAM J. Comput. 24, 1170\u20131189 (1995)","journal-title":"SIAM J. Comput."},{"key":"9370_CR12","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/978-1-4612-1872-2_10","volume-title":"Complexity Theory Retrospective II","author":"J.H. Lutz","year":"1997","unstructured":"Lutz, J.H.: The quantitative structure of exponential time. In: Complexity Theory Retrospective II, pp.\u00a0225\u2013260. Springer, New York (1997)"},{"key":"9370_CR13","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1137\/S0097539792237498","volume":"23","author":"J.H. Lutz","year":"1994","unstructured":"Lutz, J.H., Mayordomo, E.: Measure, stochasticity, and the density of hard languages. SIAM J. Comput. 23, 762\u2013779 (1994)","journal-title":"SIAM J. Comput."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9370-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-011-9370-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9370-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T07:54:23Z","timestamp":1558684463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-011-9370-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,2]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["9370"],"URL":"https:\/\/doi.org\/10.1007\/s00224-011-9370-3","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,2]]}}}