{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:06Z","timestamp":1725662886646},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540073895"},{"type":"electronic","value":"9783540375852"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1975]]},"DOI":"10.1007\/3-540-07389-2_187","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T10:54:25Z","timestamp":1330167265000},"page":"125-137","source":"Crossref","is-referenced-by-count":5,"title":["On problems solvable by successive trials"],"prefix":"10.1007","author":[{"given":"B. A.","family":"Trakhtenbrot","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,21]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Cook, S.A., The complexity of theorem-proving procedures. Third Annual ACM Symp. on Theory of Computing, 1971, 151\u2013158.","DOI":"10.1145\/800157.805047"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Cook, S.A. and Reckhow, R., On the length of proofs in the propositional calculus. Sixth Annual ACM Symp. on Theory of Computing, 1974, 135\u2013146.","DOI":"10.1145\/800119.803893"},{"issue":"4","key":"10_CR3","first-page":"748","volume":"189","author":"M. I. Dekhtyar'","year":"1969","unstructured":"Dekhtyar', M.I., Impossibility of eliminating complete enumeration in computing functions from their diagrams. Dokl.Akad. Nauk SSSR, 1969, Vol. 189, No.4, pp. 748\u2013751.","journal-title":"Dokl.Akad. Nauk SSSR"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Gill, J.T., Computational complexity of probabilistic Turing machines. Sixth Annual ACM Symp. on Theory of Computing, 1974, pp. 91\u201395.","DOI":"10.1145\/800119.803889"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Reducibility among combinatorial problems. In Complexity of computer computations, Miller and Thatcher (eds.), Plenum Press, 1973, pp. 85\u2013109.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Lander, R.E., Polynomial time reducibilities. Fifth Annual ACM Symp. on Theory of Computing, 1973, pp. 122\u2013129.","DOI":"10.1145\/800125.804042"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Lander, R., Lynch, N., Selman, A.L., Comparison of polynomial-time reducibilities. Sixth Annual ACM Symp. on Theory of Computing, 1974, pp. 110\u2013121.","DOI":"10.1145\/800119.803891"},{"issue":"3","key":"10_CR8","first-page":"115","volume":"9","author":"L. A. Levin","year":"1973","unstructured":"Levin, L.A., Universal trial problems. Problems of information transmission, 1973, 9, No.3, pp.115\u2013116.","journal-title":"Problems of information transmission"},{"key":"10_CR9","unstructured":"Rogers,Jr.H., Theory of recursive functions and effective computability, New York, 1967."},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L.J., Meyer, A.R. Word problems requiring exponential time. Fifth Annual ACM Symp. on Theory of Computing, 1973, pp. 1\u20139.","DOI":"10.1145\/800125.804029"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Trakhtenbrot, B.A., Formalization of some notions in terms of computational complexity. In Logic, Methodology and Philosophy of Science IV, P.Suppes et al., eds., North-Holland Publ.Comp., 1973, pp.205\u2013213.","DOI":"10.1016\/S0049-237X(09)70359-3"},{"key":"10_CR12","first-page":"159","volume-title":"Theory of Algorithms and Mathematical Logic","author":"B. A. Trakhtenbrot","year":"1974","unstructured":"Trakhtenbrot, B.A., Notes on computational complexity on probabilistic machines. In Theory of Algorithms and Mathematical Logic, Computing Centre of the USSR Academy of Sciences, Moscow, 1974, pp. 159\u2013176."},{"key":"10_CR13","unstructured":"Trakhtenbrot, B.A., Barzdin Ya.M., Finite automata (behaviour and synthesis), North-Holland, 1973."},{"key":"10_CR14","unstructured":"Vaiser, A.B., On probabilistic machines and languages. Second All-Union Conference on Problems of Theoretical Cybernetics, Theses, Novosibirsk, 1971."},{"key":"10_CR15","first-page":"75","volume":"2","author":"S. V. Yablonskii","year":"1959","unstructured":"Yablonskii, S.V., On algorithmic difficulties in synthesis of minimal schemes. Problems of Cybernetics, 1959, 2, pp.75\u2013121.","journal-title":"Problems of Cybernetics"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1975 4th Symposium, Mari\u00e1nsk\u00e9 L\u00e1zn\u011b, September 1\u20135, 1975"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-07389-2_187.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T19:38:29Z","timestamp":1640893109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-07389-2_187"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975]]},"ISBN":["9783540073895","9783540375852"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-07389-2_187","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1975]]}}}