{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:15:22Z","timestamp":1759335322561},"reference-count":7,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"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":[[2000,7]]},"DOI":"10.1016\/s0020-0190(00)00076-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:37:09Z","timestamp":1027615029000},"page":"61-64","source":"Crossref","is-referenced-by-count":3,"title":["Exact solution of a minimal recurrence"],"prefix":"10.1016","volume":"75","author":[{"given":"Keh-Ning","family":"Chang","sequence":"first","affiliation":[]},{"given":"Shi-Chun","family":"Tsai","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0020-0190(00)00076-4_ID005","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1137\/S0895480192232862","article-title":"Multidimensional divide-and-conquer maximin recurrences","volume":"Vol. 8","author":"Alonso","year":"1995","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0020-0190(00)00076-4_ID006","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1137\/0603038","article-title":"Some maximal solutions of the generalized subadditive inequality","volume":"Vol. 3","author":"Batty","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0020-0190(00)00076-4_ID007","series-title":"Optimal Boolean circuits with unreliable gates","author":"Chang","year":"1998"},{"key":"10.1016\/S0020-0190(00)00076-4_ID008","series-title":"Proc. 35th Annual IEEE Symposium on Foundations of Computer Science","first-page":"332","article-title":"On the design of reliable Boolean circuits that contain partially unreliable gates","author":"Kleitman","year":"1994"},{"issue":"6","key":"10.1016\/S0020-0190(00)00076-4_ID009","doi-asserted-by":"crossref","first-page":"1188","DOI":"10.1137\/0218079","article-title":"Solution of a divide-and-conquer maximin recurrence","volume":"Vol. 18","author":"Li","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(00)00076-4_ID010","series-title":"An Introduction to the Analysis of Algorithms","author":"Sedgewick","year":"1996"},{"key":"10.1016\/S0020-0190(00)00076-4_ID011","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1006\/jagm.1996.0839","article-title":"Tighter bounds on the solution of a divide-and-conquer maximin recurrence","volume":"Vol. 23","author":"Wang","year":"1997","journal-title":"J. Algorithms"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000764?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000764?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T03:22:39Z","timestamp":1555816959000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000000764"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":7,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0020019000000764"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00076-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}