{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T14:38:47Z","timestamp":1649083127222},"reference-count":5,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"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":4307,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1016\/s0166-218x(00)00371-1","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T11:12:20Z","timestamp":1034593940000},"page":"227-231","source":"Crossref","is-referenced-by-count":0,"title":["Upper bounds for the complexity of sequences generated by symmetric Boolean functions"],"prefix":"10.1016","volume":"114","author":[{"given":"Yu.V.","family":"Merekin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0166-218X(00)00371-1_BIB1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","article-title":"On the complexity of finite sequences","volume":"22","author":"Lempel","year":"1976","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(00)00371-1_BIB2","series-title":"Combinatorics on Words","author":"Lothaire","year":"1983"},{"key":"10.1016\/S0166-218X(00)00371-1_BIB3","unstructured":"O.B. Lupanov, Asymptotic Bounds on the Complexity of Control Systems, Moscow State University, Moscow, 1984 (in Russian)."},{"key":"10.1016\/S0166-218X(00)00371-1_BIB4","unstructured":"Yu.V. Merekin, Lower bound of complexity for words concatenation schemes, Discrete Analysis Oper. Res. 3 (1) (1996) 52\u201356 (in Russian)."},{"issue":"11","key":"10.1016\/S0166-218X(00)00371-1_BIB5","first-page":"41","article-title":"Jahresbericht der Deutschen Mathematiker","volume":"47","author":"Scholz","year":"1937","journal-title":"Vereiningung"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003711?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003711?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T16:25:37Z","timestamp":1556209537000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00003711"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":5,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0166218X00003711"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00371-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}