{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T23:49:47Z","timestamp":1648597787357},"reference-count":8,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5433,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,9]]},"DOI":"10.1016\/s0304-3975(98)00034-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:48:18Z","timestamp":1027630098000},"page":"99-118","source":"Crossref","is-referenced-by-count":5,"title":["On the disjunctive set problem"],"prefix":"10.1016","volume":"204","author":[{"given":"P.","family":"Goralcik","sequence":"first","affiliation":[]},{"given":"V.","family":"Koubek","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00034-6_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0304-3975(98)00034-6_BIB2","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0304-3975(85)90042-8","article-title":"Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra","volume":"36","author":"Demel","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00034-6_BIB3","series-title":"Proc. FCT'79, Mathematical Research, Akademie-Verlag","first-page":"99","article-title":"Several algorithms for finite algebras","author":"Demlov\u00e1","year":"1979"},{"key":"10.1016\/S0304-3975(98)00034-6_BIB4","series-title":"Computers and Intractability, a guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(98)00034-6_BIB5","first-page":"73","article-title":"On syntacticity of finite regular semigroups","volume":"25","author":"Goral\u010dik","year":"1982"},{"key":"10.1016\/S0304-3975(98)00034-6_BIB6","series-title":"Semigroups and Combinatorial Applications","author":"Lallement","year":"1979"},{"key":"10.1016\/S0304-3975(98)00034-6_BIB7","first-page":"289","article-title":"A homomorphism theorem for finite semigroups","volume":"4","author":"Rhodes","year":"1969","journal-title":"Math. System Theory"},{"key":"10.1016\/S0304-3975(98)00034-6_BIB8","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000346?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000346?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T09:01:45Z","timestamp":1555405305000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598000346"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":8,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["S0304397598000346"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00034-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}