{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:28Z","timestamp":1725662908494},"publisher-location":"Berlin, Heidelberg","reference-count":11,"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_229","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:55:50Z","timestamp":1330185350000},"page":"432-438","source":"Crossref","is-referenced-by-count":4,"title":["On polynomial reducibility of word problem under embedding of recursively presented groups in finitely presented groups"],"prefix":"10.1007","author":[{"given":"M. K.","family":"Valiev","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,21]]},"reference":[{"key":"52_CR1","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1098\/rspa.1961.0132","volume":"262","author":"G. Higman","year":"1961","unstructured":"Higman, G., Subgroups of finitely presented groups. Proc. Roy. Soc., Ser. A 262(1961), 455\u2013475.","journal-title":"Proc. Roy. Soc."},{"key":"52_CR2","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1112\/plms\/s3-14.4.633","volume":"XIV","author":"C. R. J. J. Clapham","year":"1964","unstructured":"Clapham, C.R.J., Finitely presented groups with word problems of arbitrary degrees of unsolvability. Proc. Lond. Math. Soc., XIV(1964) 633\u2013676.","journal-title":"Proc. Lond. Math. Soc."},{"key":"52_CR3","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1112\/plms\/s3-17.3.419","volume":"XVII","author":"C. R. J. J. Clapham","year":"1967","unstructured":"Clapham, C.R.J., An embedding theorem for finitely generated groups. Proc. Lond. Math. Soc., XVII(1967), 419\u2013430.","journal-title":"Proc. Lond. Math. Soc."},{"key":"52_CR4","volume-title":"Embeddings of primitive recursive computable groups","author":"R. W. Gatterdam","year":"1970","unstructured":"Gatterdam, R.W., Embeddings of primitive recursive computable groups, doctoral diss., Univ. of California, Irvine, 1970."},{"key":"52_CR5","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1017\/S0004972700045469","volume":"8","author":"R. W. Gatterdam","year":"1973","unstructured":"Gatterdam, R.W., The computability of group constructions II. Bull. Austr. Math. Soc., 8(1973), 27\u201360.","journal-title":"Bull. Austr. Math. Soc."},{"key":"52_CR6","first-page":"1","volume":"4","author":"A. Grzegorczyk","year":"1953","unstructured":"Grzegorczyk, A., Some classes of recursive functions. Rozprawy Math., 4(1953), 1\u201346.","journal-title":"Rozprawy Math."},{"key":"52_CR7","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF02219819","volume":"8","author":"M. K. Valiev","year":"1969","unstructured":"Valiev, M.K., On complexity of word problem for finitely presented groups. Algebra and logic, 8(1969), 5\u201343.","journal-title":"Algebra and logic"},{"key":"52_CR8","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02218595","volume":"7","author":"M. K. Valiev","year":"1968","unstructured":"Valiev, M.K., One theorem of G. Higman. Algebra and logic, 7(1968), 9\u201322.","journal-title":"Algebra and logic"},{"key":"52_CR9","first-page":"93","volume":"8","author":"B. A. Trachtenbrot","year":"1969","unstructured":"Trachtenbrot, B.A., On the complexity of reduction algorithms in Novikov-Boone constructions. Algebra and logic, 8(1969), 93\u2013128.","journal-title":"Algebra and logic"},{"key":"52_CR10","first-page":"279","volume":"191","author":"Ju. V. Matijasevic","year":"1970","unstructured":"Matijasevic, Ju.V., Enumerable sets are Diofantine. Dokl. Akad. Nauk SSSR, 191(1970), 279\u2013282.","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"52_CR11","doi-asserted-by":"crossref","first-page":"16","DOI":"10.2307\/1970200","volume":"77","author":"J. L. Britton","year":"1963","unstructured":"Britton, J.L., The word problem. Ann. Math. 77(1963), 16\u201332.","journal-title":"Ann. Math."}],"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_229.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:57:28Z","timestamp":1605643048000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-07389-2_229"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975]]},"ISBN":["9783540073895","9783540375852"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-07389-2_229","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1975]]}}}