{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:20:16Z","timestamp":1742617216879,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540613770"},{"type":"electronic","value":"9783540685074"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61377-3_36","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:36:25Z","timestamp":1330292185000},"page":"145-160","source":"Crossref","is-referenced-by-count":4,"title":["A note on the relation between polynomial time functionals and Constable's class K"],"prefix":"10.1007","author":[{"given":"P.","family":"Clote","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(91)90057-S","volume":"53","author":"B. Allen","year":"1991","unstructured":"B. Allen. Arithmetizing uniform NC. Annals of Pure and Applied Logic, 53(1):1\u201350, 1991.","journal-title":"Annals of Pure and Applied Logic"},{"issue":"3","key":"9_CR2","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","volume":"41","author":"D. M. Barrington","year":"1990","unstructured":"D. Mix Barrington, N. Immerman, and H. Straubing. On uniformity in NC 1. Journal of Computer and System Science, 41(3):274\u2013306, 1990.","journal-title":"Journal of Computer and System Science"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"P. Clote. Polynomial size frege proofs of certain combinatorial principles. In P. Clote and J. Kraj\u00ed\u010dek, editors, Arithmetic, Proof Theory and Computational Complexity, pages 162\u2013184. Oxford University Press, 1993.","DOI":"10.1093\/oso\/9780198536901.003.0007"},{"key":"9_CR4","unstructured":"P. Clote. Computation models and function algebras. In E. Griffor, editor, Handbook of Recursion Theory. in preparation."},{"key":"9_CR5","unstructured":"P. Clote, B. Kapron, and A. Ignjatovic. Parallel computable higher type functionals. Technical Report BCCS-94-04, Department of Computer Science, Boston College, June 1994."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"P. Clote, B. Kapron, and A. Ignjatovic. Parallel computable higher type functionals. In Proceedings of IEEE 34th Annual Symposium on Foundations of Computer Science, Nov 3\u20135, 1993. Palo Alto CA. pp. 72\u201383.","DOI":"10.1109\/SFCS.1993.366880"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"P. Clote and G. Takeuti. First order bounded arithmetic and small boolean circuit complexity classes. In P. Clote and J. Remmel, editors, Feasible Mathematics II, pages 154\u2013218. Birkh\u00e4user Boston Inc., 1995.","DOI":"10.1007\/978-1-4612-2566-9_6"},{"key":"9_CR8","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1137\/0220036","volume":"20","author":"P. Clote","year":"1991","unstructured":"Peter Clote and Evangelos Kranakis. Boolean functions, invariance groups and parallel complexity. SIAM J. Comput. 20:553\u2013590, 1991.","journal-title":"SIAM J. Comput."},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"P.G. Clote. Sequential, machine-independent characterizations of the parallel complexity classes ALOGTIME, AC k,NCk and NC. In P.J. Scott S.R. Buss, editor, Feasible Mathematics, pages 49\u201370. Birkh\u00e4user, 1990.","DOI":"10.1007\/978-1-4612-3466-1_4"},{"key":"9_CR10","unstructured":"A. Cobham. The intrinsic computational difficulty of functions. In Y. Bar-Hillel, editor, Logic, Methodology and Philosophy of Science II, pages 24\u201330. North-Holland, 1965."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"R. Constable. Type 2 computational complexity. In 5th Annual ACM Symposium on Theory of Computing, 1973. pp. 108\u2013121.","DOI":"10.1145\/800125.804041"},{"key":"9_CR12","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds. Paths, trees, flowers. Canad. J. Math., 17:449\u2013467, 1965.","journal-title":"Canad. J. Math."},{"key":"9_CR13","first-page":"1","volume":"50","author":"L. K\u00e1lmar","year":"1943","unstructured":"L. K\u00e1lmar. Egyszer\u00fc p\u00e9lda eld\u00f6nthetetlen aritmetikai probl\u00e9m\u00e1ra. Mate \u00e9s Fizikai Lapok, 50:1\u201323, 1943. [In Hungarian with German abstract].","journal-title":"Mate \u00e9s Fizikai Lapok"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"B. Kapron and S. Cook. A new characterization of Mehlhorn's poly time functionals. In Proceedings of IEEE 32th Annual Symposium on Foundations of Computer Science, pages pp. 342\u2013347, 1991. Journal version in SIAM J. on Comput.","DOI":"10.1109\/SFCS.1991.185389"},{"key":"9_CR15","unstructured":"J.C. Lind. Computing in logarithmic space. Technical Report Project MAC Technical Memorandum 52, Massachusetts Institute of Technology, September 1974."},{"key":"9_CR16","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(76)80035-9","volume":"12","author":"K. Mehlhorn","year":"1976","unstructured":"K. Mehlhorn. Polynomial and abstract subrecursive classes. Journal of Computer and System Science, 12:147\u2013178, 1976.","journal-title":"Journal of Computer and System Science"},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0304-3975(76)90065-7","volume":"3","author":"B. Monien","year":"1977","unstructured":"B. Monien. A recursive and grammatical characterization of exponential time languages. Theoretical Computer Science, 3:61\u201374, 1977.","journal-title":"Theoretical Computer Science"},{"key":"9_CR18","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1090\/S0002-9947-1963-0158822-2","volume":"106","author":"R.W. Ritchie","year":"1963","unstructured":"R.W. Ritchie. Classes of predictably computable functions. Trans. Am. Math. Soc., 106:139\u2013173, 1963.","journal-title":"Trans. Am. Math. Soc."},{"key":"9_CR19","volume-title":"Subrecursion: Function and Hierarchies, volume 9 of Oxford Logic Guides","author":"H. E. Rose","year":"1984","unstructured":"H. E. Rose. Subrecursion: Function and Hierarchies, volume 9 of Oxford Logic Guides, Clarendon Press, Oxford, 1984. 191 pages."},{"key":"9_CR20","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF01706069","volume":"6","author":"D.B. Thompson","year":"1972","unstructured":"D.B. Thompson. Subrecursiveness: machine independent notions of computability in restricted time and storage. Math. Systems Theory, 6:3\u201315, 1972.","journal-title":"Math. Systems Theory"},{"key":"9_CR21","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1305\/ndjfl\/1093635419","volume":"31","author":"M. Townsend","year":"1990","unstructured":"M. Townsend. Complexity for type-2 relations. Notre Dame Journal of Formal Logic, 31:241\u2013262, 1990.","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"K. Wagner. Bounded recursion and complexity classes. In Lecture Notes in Computer Science, volume 74, pages 492\u2013498. Springer-Verlag, 1979.","DOI":"10.1007\/3-540-09526-8_49"},{"key":"9_CR23","unstructured":"K. Wagner and G. Wechsung. Computational Complexity. Reidel Publishing Co., 1986."},{"key":"9_CR24","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01692056","volume":"20","author":"C. Wilson","year":"1987","unstructured":"C. Wilson. Relativized nc. Math. Systems Theory, 20:13\u201329, 1987.","journal-title":"Math. Systems Theory"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61377-3_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:18:34Z","timestamp":1742599114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61377-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613770","9783540685074"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-61377-3_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}