{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:48Z","timestamp":1725664188443},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540590422"},{"type":"electronic","value":"9783540491750"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59042-0_62","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:00:39Z","timestamp":1330275639000},"page":"60-70","source":"Crossref","is-referenced-by-count":9,"title":["Classes of bounded counting type and their inclusion relations"],"prefix":"10.1007","author":[{"given":"Ulrich","family":"Hertrampf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"6_CR1","unstructured":"D. P. Bovet, P. Crescenzi, R. Silvestri, Complexity Classes and Sparse Oracles; 6th\nStructure in Complexity Theory Conference (1991), pp. 102\u2013108."},{"key":"6_CR2","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(92)90125-Y","volume":"104","author":"D. P. Bovet","year":"1992","unstructured":"D. P. Bovet, P. Crescenzi, R. Silvestri, A Uniform Approach to Define Complexity Classes; Theoretical Computer Science104 (1992), pp. 263\u2013283.","journal-title":"Theoretical Computer Science"},{"key":"6_CR3","volume-title":"Ramsey Theory","author":"R. Graham","year":"1980","unstructured":"R. Graham, B. Rothschild, J. Spencer, Ramsey Theory; John Wiley & Sons (New York, 1980)."},{"key":"6_CR4","unstructured":"T. Gundermann, N. A. Nasser, G. Wechsung, A Survey on Counting Classes; 5th\nStructure in Complexity Theory Conference (1990), pp. 140\u2013153."},{"key":"6_CR5","first-page":"395","volume":"6","author":"T. Gundermann","year":"1987","unstructured":"T. Gundermann, G. Wechsung, Counting Classes of Finite Acceptance Types; Computers and Artificial Intelligence6 (1987), pp. 395\u2013409.","journal-title":"Computers and Artificial Intelligence"},{"key":"6_CR6","first-page":"199","volume":"577","author":"U. Hertrampf","year":"1992","unstructured":"U. Hertrampf, Locally Definable Acceptance Types for Polynomial Time Machines; 9thSymposium on Theoretical Aspects of Computer Science (1992), LNCS 577, pp. 199\u2013207.","journal-title":"LNCS"},{"key":"6_CR7","first-page":"262","volume":"583","author":"U. Hertrampf","year":"1992","unstructured":"U. Hertrampf, Locally Definable Acceptance Types \u2014 The Three-Valued Case; 1thLatin American Symposium on Theoretical Informatics (1992), LNCS 583, pp. 262\u2013271.","journal-title":"LNCS"},{"key":"6_CR8","first-page":"543","volume":"775","author":"U. Hertrampf","year":"1994","unstructured":"U. Hertrampf, Complexity Classes with Finite Acceptance Types; 11thSymposium on Theoretical Aspects of Computer Science (1994), LNCS 775, pp. 543\u2013553.","journal-title":"LNCS"},{"key":"6_CR9","unstructured":"U. Hertrampf, Complexity Classes Defined via k-valued Functions; 9th\nStructure in Complexity Theory Conference (1994), pp. 224\u2013234."},{"key":"6_CR10","unstructured":"U. Hertrampf, On Simple Closure Properties of #P; Technical Report No. 90, Universit\u00e4t W\u00fcrzburg (1994)."},{"key":"6_CR11","unstructured":"U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer, K. W. Wagner, On the Power of Polynomial Time Bit-Reductions; 8th\nStructure in Complexity Theory Conference (1993), pp. 200\u2013207."},{"key":"6_CR12","unstructured":"U. Hertrampf, H. Vollmer, K. W. Wagner, On Balanced vs. Unbalanced Computation Trees; Mathematical Systems Theory, to appear."},{"key":"6_CR13","unstructured":"B. Jenner, P. McKenzie, D. Th\u00e9rien, Logspace and Logtime Leaf Languages; 9th\nStructure in Complexity Theory Conference (1994), pp. 242\u2013254."},{"key":"6_CR14","first-page":"473","volume":"665","author":"R. Niedermeyer","year":"1993","unstructured":"R. Niedermeyer, P. Rossmanith, Extended Locally Definable Acceptance Types; 10thSymposium on Theoretical Aspects of Computer Science (1993), LNCS 665, pp. 473\u2013483.","journal-title":"LNCS"},{"key":"6_CR15","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"30","author":"F. P. Ramsey","year":"1930","unstructured":"F. P. Ramsey, On a Problem of Formal Logic; Proceedings London Math. Society30 (1930), pp. 264\u2013286.","journal-title":"Proceedings London Math. Society"},{"key":"6_CR16","unstructured":"O. Verbitsky, Towards the Parallel Repitition Conjecture; 9th\nStructure in Complexity Theory Conference (1994), pp. 304\u2013307."},{"issue":"2","key":"6_CR17","first-page":"51","volume":"57","author":"N. K. Vereshchagin","year":"1993","unstructured":"N. K. Vereshchagin, Relativizable and Nonrelativizable Theorems in the Polynomial Theory of Algorithms; Izvestija Rossijskoj Akademii Nauk57(2) (1993), pp. 51\u201390.","journal-title":"Izvestija Rossijskoj Akademii Nauk"},{"key":"6_CR18","unstructured":"K. W. Wagner, personal communication, 1990."}],"container-title":["Lecture Notes in Computer Science","STACS 95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59042-0_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:22:10Z","timestamp":1619572930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59042-0_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590422","9783540491750"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-59042-0_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}