{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T11:04:55Z","timestamp":1648811095395},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1983,7,1]],"date-time":"1983-07-01T00:00:00Z","timestamp":425865600000},"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 Sciences"],"published-print":{"date-parts":[[1983,7]]},"DOI":"10.1016\/0020-0255(83)90044-0","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T17:28:37Z","timestamp":1056994117000},"page":"37-45","source":"Crossref","is-referenced-by-count":5,"title":["Minimization of Boolean functions of any number of variables using decimal labels"],"prefix":"10.1016","volume":"30","author":[{"given":"Malay","family":"Sen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0255(83)90044-0_BIB1","doi-asserted-by":"crossref","first-page":"521","DOI":"10.2307\/2308219","article-title":"The problem of simplifying truth functions","volume":"59","author":"Quine","year":"1952","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0020-0255(83)90044-0_BIB2","series-title":"A Survey of Switching Circuit Theory","author":"McCluskey","year":"1962"},{"key":"10.1016\/0020-0255(83)90044-0_BIB3","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1109\/TEC.1956.5219932","article-title":"A topological method for the determination of minimisation of a Boolean function","volume":"Ec-5","author":"Urbano","year":"1966","journal-title":"IRE Trans. Electron. Comput."},{"key":"10.1016\/0020-0255(83)90044-0_BIB4","doi-asserted-by":"crossref","first-page":"1337","DOI":"10.1002\/j.1538-7305.1962.tb03280.x","article-title":"A method for simplifying Boolean functions","volume":"41","author":"Scheinman","year":"1962","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0020-0255(83)90044-0_BIB5","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1109\/TEC.1962.5219441","article-title":"A mechanized chart for simplification of switching functions","volume":"Ec-11","author":"Choudhury","year":"1962","journal-title":"IRE Trans. Electron. Comput."},{"key":"10.1016\/0020-0255(83)90044-0_BIB6","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1109\/T-C.1971.223373","article-title":"Minimisation of Boolean functions","volume":"C-20","author":"Biswas","year":"1971","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0255(83)90044-0_BIB7","series-title":"Switching Circuits and Logical Design","author":"Caldwell","year":"1958"},{"key":"10.1016\/0020-0255(83)90044-0_BIB8","series-title":"Logical Design of Digital Computers","author":"Phister","year":"1958"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025583900440?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025583900440?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T12:53:31Z","timestamp":1552913611000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020025583900440"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,7]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,7]]}},"alternative-id":["0020025583900440"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(83)90044-0","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1983,7]]}}}