{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:16:03Z","timestamp":1648772163061},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1986,1]]},"DOI":"10.1016\/0020-0190(86)90147-x","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T15:53:30Z","timestamp":1048607610000},"page":"91-95","source":"Crossref","is-referenced-by-count":0,"title":["Verifying nonrigidity"],"prefix":"10.1016","volume":"22","author":[{"given":"Pavel","family":"Goral\u010d\u00edk","sequence":"first","affiliation":[]},{"given":"V\u00e1clav","family":"Koubek","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(86)90147-X_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1976"},{"key":"10.1016\/0020-0190(86)90147-X_BIB2","series-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1976"},{"key":"10.1016\/0020-0190(86)90147-X_BIB3","doi-asserted-by":"crossref","first-page":"375","DOI":"10.4153\/CMB-1970-071-3","article-title":"Graphs and k-societies","volume":"13","author":"Hell","year":"1970","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0020-0190(86)90147-X_BIB4","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0020-0190(86)90147-X_BIB5","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF02570800","article-title":"On a technique for representing semigroups and endomorphism semigroups of graphs with given properties","volume":"4","author":"Mendelsohn","year":"1972","journal-title":"Semigroup Forum"},{"key":"10.1016\/0020-0190(86)90147-X_BIB6","doi-asserted-by":"crossref","first-page":"1359","DOI":"10.2140\/pjm.1963.13.1359","article-title":"\u00dcber Abbildungen von Mengen","volume":"13","author":"Novotn\u00fd","year":"1963","journal-title":"Pacif. J. Math."},{"key":"10.1016\/0020-0190(86)90147-X_BIB7","article-title":"Combinatorial, Algebraic, and Topological Representations of Groups, Semigroups, and Categories","author":"Pultr","year":"1980"},{"key":"10.1016\/0020-0190(86)90147-X_BIB8","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02242355","article-title":"Schnelle Multiplikation grosser Zahlen","volume":"7","author":"Sch\u00f6nhage","year":"1971","journal-title":"Computing"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908690147X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908690147X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T17:29:40Z","timestamp":1553448580000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001908690147X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,1]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,1]]}},"alternative-id":["002001908690147X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(86)90147-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1986,1]]}}}