{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:38Z","timestamp":1725663698026},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540577850"},{"type":"electronic","value":"9783540483328"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57785-8_170","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:20:42Z","timestamp":1330262442000},"page":"543-553","source":"Crossref","is-referenced-by-count":7,"title":["Complexity classes with finite acceptance types"],"prefix":"10.1007","author":[{"given":"Ulrich","family":"Hertrampf","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"44_CR1","unstructured":"D. P. Bovet, P. Crescenzi, R. Silvestri, Complexity classes and sparse oracles; 6th Structure in Complexity Theory Conference (1991), pp. 102\u2013108."},{"key":"44_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":"44_CR3","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":"44_CR4","unstructured":"T. Gundermann, N. A. Nasser, G. Wechsung, A survey on counting classes; 5th Structure in Complexity Theory Conference (1990), pp. 140\u2013153."},{"key":"44_CR5","first-page":"199","volume":"577","author":"U. Hertrampf","year":"1992","unstructured":"U. Hertrampf, Locally definable acceptance types for polynomial time machines; 9th Symposium on Theoretical Aspects of Computer Science (1992), LNCS 577, pp. 199\u2013207.","journal-title":"LNCS"},{"key":"44_CR6","first-page":"262","volume":"583","author":"U. Hertrampf","year":"1992","unstructured":"U. Hertrampf, Locally definable acceptance types \u2014 the three-valued case; 1st Latin American Symposium on Theoretical Informatics (1992), LNCS 583, pp. 262\u2013271.","journal-title":"LNCS"},{"key":"44_CR7","unstructured":"U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer, K. W. Wagner, On the power of polynomial time bit-reductions; 8th Structure in Complexity Theory Conference (1993), pp. 200\u2013207."}],"container-title":["Lecture Notes in Computer Science","STACS 94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57785-8_170.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:08:06Z","timestamp":1619572086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57785-8_170"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540577850","9783540483328"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-57785-8_170","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}