{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:49:15Z","timestamp":1725515355399},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540686767"},{"type":"electronic","value":"9783540686798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-68679-8_48","type":"book-chapter","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T06:58:16Z","timestamp":1213081096000},"page":"778-796","source":"Crossref","is-referenced-by-count":0,"title":["Some Theorems Concerning the Core Function"],"prefix":"10.1007","author":[{"given":"Angelo Raffaele","family":"Meo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_CR1","first-page":"155","volume":"29","author":"A.R. Meo","year":"2005","unstructured":"Meo, A.R.: On the minimization of core function Acc. Sc. Torino \u2013 Memorie Sc. Fis.\u00a029, 155\u2013178, 7 ff. (2005)","journal-title":"Sc. Torino \u2013 Memorie Sc. Fis."},{"key":"48_CR2","unstructured":"Sipser, M.: Introduction to the theory of computation, PWS Publ.Comp. (1997)"},{"issue":"2","key":"48_CR3","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF03025291","volume":"20","author":"S. Smale","year":"1998","unstructured":"Smale, S.: Mathematical problems for the next century. Mathematical Intelligencer\u00a020(2), 7\u201315 (1998)","journal-title":"Mathematical Intelligencer"},{"key":"48_CR4","volume-title":"Computers and intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. W.H.Freeman and Co., New York (1979)"},{"key":"48_CR5","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1002\/malq.19550010403","volume":"1","author":"G. Asser","year":"1955","unstructured":"Asser, G.: Das Reprasentantenproblem im Pradikatenkalkul der ersten Stufe mit Identitat, Zietschr.f.Mathematisches Logik u. Grundlagen der Math.\u00a01, 252\u2013263 (1955)","journal-title":"Grundlagen der Math."},{"key":"48_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/800157.805047","volume-title":"Proc. 3rd Annual ACM Symp. on Theory of Computing","author":"S.A. Cook","year":"1971","unstructured":"Cook, S.A.: The complexity of theorem proving procedures. In: Proc. 3rd Annual ACM Symp. on Theory of Computing, pp. 151\u2013158. ACM Press, New York (1971)"},{"key":"48_CR7","first-page":"55","volume-title":"Proceeding of the International Congress of Mathematicians","author":"S.A. Cook","year":"1991","unstructured":"Cook, S.A.: Computational complexity of higher type functions. In: Sarake, I. (ed.) Proceeding of the International Congress of Mathematicians, Kyoto, Japan, pp. 55\u201360. Springer, Heidelberg (1991)"},{"key":"48_CR8","volume-title":"Arithmetic, Proof Theory and Computational Complexity","author":"K. Godel","year":"1993","unstructured":"Godel, K.: A letter to J.von Neumann, in Sipser\u2019s article listed above. In: Clote, P., Krajicek, J. (eds.) Arithmetic, Proof Theory and Computational Complexity, Oxford University Press, Oxford (1993)"},{"key":"48_CR9","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility Among Combinatorial Problems, Complexity of Computer Computations, pp. 85\u2013103. Plenum Press (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"3","key":"48_CR10","first-page":"265","volume":"9","author":"L. Levin","year":"1973","unstructured":"Levin, L.: Universal Search Problems. Problemy Peredachi Informatsii (= Problems of Information Transmission)\u00a09(3), 265\u2013266 (in Russian) (1973); A partial English transalation, In: Trakhtenbrot, B.A.: A Survey of Russian Approches to Perebor (Brute-force Search) Algorithms. Annals of the History of Computing\u00a06(4), 384\u2013400 (1984)","journal-title":"Problemy Peredachi Informatsii (= Problems of Information Transmission)"},{"key":"48_CR11","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1017\/S0022481200100076","volume":"17","author":"H. Scholz","year":"1952","unstructured":"Scholz, H.: Problem #1: Ein ungelostes Problem in der symbolisches Logik. Symbolic Logic\u00a017, 160 (1952)","journal-title":"Symbolic Logic"},{"key":"48_CR12","first-page":"603","volume-title":"Proceedings of the 24th Annual ACM Symposium on Theory of Computing","author":"M. Sipser","year":"1992","unstructured":"Sipser, M.: The history and status of the P versus NP question. In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pp. 603\u2013618. ACM Press, New York (1992)"},{"key":"48_CR13","first-page":"431","volume":"4","author":"T. Baker","year":"1975","unstructured":"Baker, T., Gill, J., Solovay, R.: Relativizations of the P =? NP question. IAM J. of Computing\u00a04, 431\u2013442 (1975)","journal-title":"IAM J. of Computing"},{"key":"48_CR14","doi-asserted-by":"crossref","unstructured":"Boppana, R., Sipser, M.: Complexity of finite functions. In: van Leeuwen, J. (ed.) Handbook of heoretical Computer Science, pp. 758\u2013804 (1990)","DOI":"10.1016\/B978-0-444-88071-0.50019-9"},{"key":"48_CR15","volume-title":"Bounded arithmetic, propositional logic, and omplexity theory, Encyclopedia of Mathematics and Its Applications","author":"J. Krajicek","year":"1995","unstructured":"Krajicek, J.: Bounded arithmetic, propositional logic, and omplexity theory, Encyclopedia of Mathematics and Its Applications, vol.\u00a060. Cambridge University Press, Cambridge (1995)"},{"key":"48_CR16","volume-title":"Handbook of Proof Theory","author":"P. Pudlak","year":"1998","unstructured":"Pudlak, P.: The lengths of proofs. In: Buss, S.R. (ed.) Handbook of Proof Theory, North-Holland, Amsterdam (1998)"}],"container-title":["Lecture Notes in Computer Science","Concurrency, Graphs and Models"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68679-8_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T01:47:55Z","timestamp":1557625675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68679-8_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540686767","9783540686798"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68679-8_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}