{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T00:50:28Z","timestamp":1648601428160},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1974,9,1]],"date-time":"1974-09-01T00:00:00Z","timestamp":147225600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer and Information Sciences"],"published-print":{"date-parts":[[1974,9]]},"DOI":"10.1007\/bf00977257","type":"journal-article","created":{"date-parts":[[2005,1,14]],"date-time":"2005-01-14T09:45:41Z","timestamp":1105695941000},"page":"251-271","source":"Crossref","is-referenced-by-count":6,"title":["Redundancy check technique for designing optimal networks by branch-and-bound method"],"prefix":"10.1007","volume":"3","author":[{"given":"Hung Chi","family":"Lai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoyasu","family":"Nakagawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saburo","family":"Muroga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/978-1-4615-8243-4_5","volume-title":"Advances in Information System Science, Vol. 3","author":"S. Muroga","year":"1970","unstructured":"S. Muroga, ?Logical design of optimal digital networks by integer programming,? inAdvances in Information System Science, Vol. 3, ed. by J. T. Tou (Plenum Press, NewYork, 1970), pp. 283?348."},{"key":"CR2","unstructured":"S. Muroga,Threshold Logic and Its Applications (Wiley-International, 1971)."},{"issue":"6","key":"CR3","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1109\/TC.1972.5009010","volume":"C-21","author":"S. Muroga","year":"1972","unstructured":"S. Muroga and T. Ibaraki,?Design of optimal switching networks by integer programming,?IEEE Trans. on Computers C-21(6):573?582 (1972).","journal-title":"IEEE Trans. on Computers"},{"key":"CR4","unstructured":"C. R. Baugh, T. Ibaraki, T. K. Liu, and S. Muroga, ?Optimum network design using NOR and NOR-AND gates by integer programming,? Report No. 293, Department of Computer Science, University of Illinois, January 1969."},{"issue":"1","key":"CR5","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/T-C.1974.223778","volume":"C-23","author":"T. K. Liu","year":"1974","unstructured":"T. K. Liu, K. Hohulin, L. E. Shiau, and S. Muroga, ?Logical design of optimal one-bit full adder by integer programming,?IEEE Trans. on Computers C-23(1):63?70 (1974).","journal-title":"IEEE Trans. on Computers"},{"key":"CR6","unstructured":"E. S. Davidson, ?An algorithm for NAND decomposition of combinational switching functions,? Ph.D. dissertation, Department of Electrical Engineering and Coordinated Science Laboratory, University of Illinois, 1968."},{"key":"CR7","unstructured":"T. Nakagawa and H. C. Lai, ?A branch-and-bound algorithm for optimal NOR networks (the algorithm description),? Report No. 438, Department of Computer Science, University of Illinois, April 1971."},{"key":"CR8","unstructured":"T. Nakagawa, H. C. Lai, and S. Muroga, ?Pruning and branching methods for designing optimal networks by the branch-and-bound method,? Report No. 471, Department of Computer Science, University of Illinois, August 1971."},{"key":"CR9","unstructured":"T. Nakagawa and H. C. Lai, ?Reference manual of FORTRAN program ILLOD(NOR-B) for optimal NOR networks,? Report No. 488, Department of Computer Science, University of Illinois, December 1971."},{"issue":"12","key":"CR10","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/T-C.1969.222593","volume":"C-18","author":"E. Davidson","year":"1969","unstructured":"E. Davidson, ?An algorithm for NAND decomposition under network constraints,?IEEE Trans. on Computers C-18(12):1098?1109 (1969).","journal-title":"IEEE Trans. on Computers"}],"container-title":["International Journal of Computer & Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00977257.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00977257\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00977257","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T18:38:18Z","timestamp":1556563098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00977257"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,9]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1974,9]]}},"alternative-id":["BF00977257"],"URL":"https:\/\/doi.org\/10.1007\/bf00977257","relation":{},"ISSN":["0091-7036","1573-7640"],"issn-type":[{"value":"0091-7036","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1974,9]]}}}