{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:17:25Z","timestamp":1725455845400},"publisher-location":"Berlin\/Heidelberg","reference-count":5,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354010576X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017295","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:22:34Z","timestamp":1132644154000},"page":"42-51","source":"Crossref","is-referenced-by-count":1,"title":["P \u2014 complete problems in free groups"],"prefix":"10.1007","author":[{"given":"J.","family":"Avenhaus","sequence":"first","affiliation":[]},{"given":"K.","family":"Madlener","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Avenhaus, J., Madlener, K.: Polynomial time algorithms for the Nielsen reduction and related problems, Interner Bericht, 1980 FB Informatik, Univ. Kaiserslautern"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0304-3975(76)90068-2","volume":"3","author":"N.D. Jones","year":"1977","unstructured":"Jones, N.D., Laaser, W.T.: Complete problems for deterministic polynomial time, Theor. Comp. Sci. 3 (1977) 105\u2013117","journal-title":"Theor. Comp. Sci."},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1145\/322017.322031","volume":"24","author":"R.J. Lipton","year":"1977","unstructured":"Lipton, R.J., Zalcstein, Y.: Word problems solvable in logspace, Journ. ACM, 24 (1977) 522\u2013526","journal-title":"Journ. ACM"},{"key":"7_CR4","volume-title":"Combinatorial group theory","author":"R.C. Lyndon","year":"1977","unstructured":"Lyndon, R.C., Schupp, P.E.: Combinatorial group theory, Springer, Berlin 1977"},{"key":"7_CR5","unstructured":"Magnus, W., Karrass, A., Solitar, D.: Combinatorial group theory, New York 1966"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017295.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:38:05Z","timestamp":1607549885000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017295"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354010576X"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/bfb0017295","relation":{},"subject":[]}}