{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:30Z","timestamp":1725663270856},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540083535"},{"type":"electronic","value":"9783540372851"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1977]]},"DOI":"10.1007\/3-540-08353-7_134","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:23:45Z","timestamp":1330187025000},"page":"148-161","source":"Crossref","is-referenced-by-count":2,"title":["Frequency algorithms and computations"],"prefix":"10.1007","author":[{"given":"B. A.","family":"Trakhtenbrot","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"issue":"5","key":"12_CR1","first-page":"967","volume":"191","author":"J. M. Barzdin'","year":"1970","unstructured":"Barzdin', J.M., On the frequency solution of algorithmically unsolvable mass problems, Dokl. Akad. Nauk SSSR, v. 191 (1970), No 5, 967\u2013970.","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"2","key":"12_CR2","first-page":"262","volume":"199","author":"J. M. Barzdin'","year":"1971","unstructured":"Barzdin', J.M., Complexity and exactness of solving of initial segments of membership problem for recursively enumerable set, Dokl. Akad. Nauk SSSR, v. 199(1971), No 2, 262\u2013264.","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"12_CR3","unstructured":"Freivald, R.V., On comparison of abilities of probabilistic and frequency algorithms, International symposium \"Discrete systems\", Riga, 1974."},{"key":"12_CR4","first-page":"201","volume":"II","author":"R. V. Freivald","year":"1975","unstructured":"Freivald, R.V., Speed computations by probabilistic machine, In Theory of Algorithms and Programs, II (J.M. Barzdin', ed.), Latvian State University, Riga, 1975, 201\u2013205.","journal-title":"Theory of Algorithms and Programs"},{"key":"12_CR5","unstructured":"Ivshin, V.Ju., Complexity of the frequency computations of recursive predicates, In Third All-Union Conference on Math. Logic, Novosibirsk, 1974, 86\u201388."},{"issue":"1","key":"12_CR6","first-page":"23","volume":"205","author":"E. B. Kinber","year":"1972","unstructured":"Kinber, E.B., Frequency computations of the total recursive predicates and frequency enumeration of sets, Dokl. Akad. Nauk SSSR, v. 205(1972), No 1, 23\u201325.","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"12_CR7","first-page":"48","volume":"1","author":"E. B. Kinber","year":"1974","unstructured":"Kinber E.B., On the frequency computations over infinite sequences, In Theory of Algorithms and Programs, 1(J.M. Barzdin', Ed.), Latvian State University, Riga, 1974, 48\u201367.","journal-title":"Theory of Algorithms and Programs"},{"key":"12_CR8","first-page":"174","volume":"II","author":"E. B. Kinber","year":"1975","unstructured":"Kinber, E.B., On the frequency computations in real time, In Theory of Algorithms and Programs, II, (J.M. Barzdin', Ed.), Latvian State University, Riga, 1975, 174\u2013182.","journal-title":"Theory of Algorithms and Programs"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"De Leeuw, K., Moore, E., Shannon, C., Shapiro, N., Computability by probabilistic machine, Automata studies, Princeton University Press, 1956, 183\u2013212.","DOI":"10.1515\/9781400882618-010"},{"key":"12_CR10","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0065-2458(08)60144-8","volume":"2","author":"R. McNaughton","year":"1961","unstructured":"McNaughton, R., The theory of automata, a survey, Adv. in Comput., 1961, v. 2, Acad. Press, N.-Y.-London, 379\u2013241.","journal-title":"Adv. in Comput."},{"key":"12_CR11","unstructured":"Rabin, M., Theoretical impediments to artificial intelligence, IFIP \u2014 1974, 615\u2013619."},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Rosenkrantz, D., Stearns, R., Lewis, P., Approximate algorithms for the travelling salesperson problem, 15th Annual Switching and Automata Theory, 1974, 33\u201342.","DOI":"10.1109\/SWAT.1974.4"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Rose, G., Ullian, J., Approximation of functions of the integers, pacific J. Math., 13(1963), No 2.","DOI":"10.2140\/pjm.1963.13.693"},{"issue":"3","key":"12_CR14","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni, S., Gonzales, T., P-complete approximation problems, J. of ACM, 23(1976), No 3, 555\u2013565.","journal-title":"J. of ACM"},{"key":"12_CR15","unstructured":"Trakhtenbrot, B.A., On the frequency computation of functions, Algebra and logic, 2(1963), No 1."},{"key":"12_CR16","first-page":"221","volume":"113","author":"B. A. Trakhtenbrot","year":"1973","unstructured":"Trakhtenbrot, B.A., Frequency computations, Trudy mat. Inst. Steklov, v. 113(1973), 221\u2013232.","journal-title":"Trudy mat. Inst. Steklov"},{"key":"12_CR17","unstructured":"Trakhtenbrot, B.A., Barzdin', J.M., Finite automata(behaviour and synthesis), North-Holland, 1973."},{"key":"12_CR18","volume-title":"Complexity of algorithms and computations","author":"B. A. Trakhtenbrot","year":"1967","unstructured":"Trakhtenbrot, B.A., Complexity of algorithms and computations, Novosibirsk State University, Novosibirsk, 1967."},{"key":"12_CR19","unstructured":"Trakhtenbrot, B.A., Notes on the complexity of the probabilistic machine computations, In Theory of Algorithms and Mathematical Logic, Moscow, 1974, 159\u2013176."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1977"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08353-7_134.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:59:18Z","timestamp":1605643158000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08353-7_134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977]]},"ISBN":["9783540083535","9783540372851"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-08353-7_134","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1977]]}}}