{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:29:13Z","timestamp":1725456553026},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540115762"},{"type":"electronic","value":"9783540393085"}],"license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1982]]},"DOI":"10.1007\/bfb0012777","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T08:00:52Z","timestamp":1132732852000},"page":"292-299","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A boundary of isomorphism completeness in the lattice of semigroup pseudovarieties"],"prefix":"10.1007","author":[{"given":"A.","family":"Goral\u010d\u00edkov\u00e1","sequence":"first","affiliation":[]},{"given":"P.","family":"Goral\u010d\u00edk","sequence":"additional","affiliation":[]},{"given":"V.","family":"Koubek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,10,22]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"L. Babai: Moderately exponential bound for graph isomorphism, FCT 81, Lecture Notes in Comp. Sci. 117, Springer 1981, 34\u201350.","DOI":"10.1007\/3-540-10854-8_4"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1137\/0207023","volume":"7","author":"K. S. Booth","year":"1978","unstructured":"K. S. Booth: Isomorphism testing for graphs, semigroups and finite automata are polynomially equivalent problems, SIAM J. Comput. 7 (1978), 273\u2013279.","journal-title":"SIAM J. Comput."},{"key":"26_CR3","unstructured":"K. S. Booth, Ch. J. Colbourn: Problems polynomially equivalent to graph isomorphism, Tech. Rep. CS-77-04, Univ. of Waterloo, 1979."},{"key":"26_CR4","volume-title":"Graph theory, an algorithmic approach","author":"N. Christofides","year":"1975","unstructured":"N. Christofides: Graph theory, an algorithmic approach, Acad. Press, New York, London, San Francisco, 1975."},{"key":"26_CR5","volume-title":"The algebraic theory of semigroups","author":"A. H. Clifford","year":"1967","unstructured":"A. H. Clifford, G. B. Preston: The algebraic theory of semigroups, AMS, Providence, Rhode Island, 1967."},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"L. Ku\u010dera, V. Trnkov\u00e1: Isomorphism completeness for some algebraic structures, FCT 81, Lecture Notes in Comp. Sci. 117, Springer 1981, 218\u2013225.","DOI":"10.1007\/3-540-10854-8_24"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0012777","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:57:43Z","timestamp":1558256263000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0012777"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982]]},"ISBN":["9783540115762","9783540393085"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/bfb0012777","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1982]]},"assertion":[{"value":"22 October 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}