{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:49:52Z","timestamp":1744217392600},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,8,1]],"date-time":"1993-08-01T00:00:00Z","timestamp":744163200000},"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":7290,"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":[[1993,8]]},"DOI":"10.1016\/0304-3975(93)90330-v","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"399-403","source":"Crossref","is-referenced-by-count":10,"title":["Improvements on Khrapchenko's theorem"],"prefix":"10.1016","volume":"116","author":[{"given":"Elias","family":"Koutsoupias","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90330-V_bib1","first-page":"757","article-title":"The complexity of finite functions","volume":"Vol. A","author":"Boppana","year":"1990"},{"key":"10.1016\/0304-3975(93)90330-V_bib2","series-title":"The Theory of Matrices","author":"Gantmacher","year":"1960"},{"key":"10.1016\/0304-3975(93)90330-V_bib3","first-page":"83","article-title":"Methods of determining lower bounds for the complexity of \u03c0-schemes","volume":"10","author":"Khrapchenko","year":"1972","journal-title":"Mat. Zametki"},{"key":"10.1016\/0304-3975(93)90330-V_bib4","series-title":"The Theory of Matrices","author":"Minc","year":"1988"},{"key":"10.1016\/0304-3975(93)90330-V_bib5","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0020-0190(91)90191-J","article-title":"An extension of Khrapchenko's theorem","volume":"37","author":"Zwick","year":"1991","journal-title":"Informat. Process. Lett."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390330V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390330V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:23:44Z","timestamp":1555129424000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390330V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,8]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,8]]}},"alternative-id":["030439759390330V"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90330-v","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,8]]}}}