{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,29]],"date-time":"2023-12-29T16:19:10Z","timestamp":1703866750555},"reference-count":8,"publisher":"EDP Sciences","issue":"R1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["R.A.I.R.O. Informatique th\u00e9orique"],"published-print":{"date-parts":[[1976]]},"DOI":"10.1051\/ita\/197610r100291","type":"journal-article","created":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T10:31:55Z","timestamp":1486377115000},"page":"29-38","source":"Crossref","is-referenced-by-count":4,"title":["On effective speed-up and long proofs of trivial theorems in formal theories"],"prefix":"10.1051","volume":"10","author":[{"given":"J.","family":"Hartmanis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"1. BLUM M.. A Machine-Independent Theory of the Complexity of Recursive Function. J. Assoc. Comp. Mach., vol. 14, 1967, p. 322-336.2359120155.01503","DOI":"10.1145\/321386.321395"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. BLUM M. and MARQUES I.. On Complexity Properties of Recursively Enumerable Sets. J. Symbolic Logic, vol. 38, 1973, p. 579-593.3324550335.02024","DOI":"10.2307\/2271984"},{"key":"R3","unstructured":"3. FISCHER M. J. and RABIN M. O.. Super-Exponential Complexity of Pressburger Arithmetic. In SIAM-AMS Proceedings, vol. 7, p. 27-41. American Math. Soc. Providence, RI, 1974.3666460319.68024"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. GILL J. and BLUM M.. On Almost Everywhere Complex Recursive Functions. J. Assoc. Comp. Mach., vol. 21, 1974, p. 425-435.4571650315.68038","DOI":"10.1145\/321832.321840"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. HARTMANIS J. and HOPCROFT J. E.. An Overview of the Theory of Computational Complexity. J. Assoc. Comp. Mach., vol. 18, 1971, p. 444-475.2880280226.68024","DOI":"10.1145\/321650.321661"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. LYNCH N.. On Reducability to Complex or Sparse Sets. J. Assoc. Comp. Mach., vol. 22, 1975, p. 341-345.3791500311.68037","DOI":"10.1145\/321892.321895"},{"key":"R7","unstructured":"7. ROGERS H.. The Theory of Recursive Functions and Effective Computability, McGraw Hill, New York, 1967.2244620183.01401"},{"key":"R8","unstructured":"8. STOCKMEYER L. J., The Complexity of Decision Problems in Automata Theory and Logic. Project MAC, Report MACTR-133, MIT, Cambridge, Mass., July 1974."}],"container-title":["Revue fran\u00e7aise d'automatique informatique recherche op\u00e9rationnelle. Informatique th\u00e9orique"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/197610R100291\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T05:33:06Z","timestamp":1568784786000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/197610R100291"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976]]},"references-count":8,"journal-issue":{"issue":"R1"},"alternative-id":["ita197610R100291"],"URL":"https:\/\/doi.org\/10.1051\/ita\/197610r100291","relation":{},"ISSN":["0397-9326"],"issn-type":[{"value":"0397-9326","type":"print"}],"subject":[],"published":{"date-parts":[[1976]]}}}