{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T13:45:48Z","timestamp":1774619148278,"version":"3.50.1"},"reference-count":16,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2011,3]]},"abstract":"<jats:p> Reducing the size of a logic circuit through lattice identities is an important and well-studied discrete optimization problem. In this paper, we consider a related problem of integrating several circuits into a single hypercircuit using the recently developed concept of lattice hyperterms. We give a combinatorial algorithm for integrating k-out-of-n symmetrical diagrams which play an important role in reliability theory. Our results show that the integration can reduce the number of circuit gates by more than twice. <\/jats:p>","DOI":"10.1142\/s179383091100105x","type":"journal-article","created":{"date-parts":[[2011,4,14]],"date-time":"2011-04-14T05:45:47Z","timestamp":1302759947000},"page":"101-119","source":"Crossref","is-referenced-by-count":9,"title":["CIRCUIT INTEGRATION THROUGH LATTICE HYPERTERMS"],"prefix":"10.1142","volume":"03","author":[{"given":"VARDGES","family":"MELKONIAN","sequence":"first","affiliation":[{"name":"Department of Mathematics, Ohio University, Athens, OH 45701, USA"}]}],"member":"219","published-online":{"date-parts":[[2012,4,5]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.927674"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70575-8_3"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2005.853274"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196706003189"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2008.01.043"},{"key":"rf8","volume-title":"General Lattice Theory","author":"Gratzer G.","year":"2003"},{"key":"rf10","doi-asserted-by":"crossref","unstructured":"B.\u00a0Korte and J.\u00a0Vygen, Building Bridges Between Mathematics and Computer Science, eds. M.\u00a0Gr\u00f6tschel and G. O. H.\u00a0Katona (Springer, Berlin, 2008)\u00a0pp. 333\u2013368.","DOI":"10.1007\/978-3-540-85221-6_12"},{"key":"rf11","volume-title":"Optimal Reliability Modelling","author":"Kuo W.","year":"2003"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196709004993"},{"key":"rf13","first-page":"101","volume":"58","author":"Movsisyan Y.","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1145\/1216396.1216399"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-004-4839-5"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2009.06.033"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5139-3"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2008.06.002"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1007\/BF02188010"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S179383091100105X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T21:32:28Z","timestamp":1565127148000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S179383091100105X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":16,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2012,4,5]]},"published-print":{"date-parts":[[2011,3]]}},"alternative-id":["10.1142\/S179383091100105X"],"URL":"https:\/\/doi.org\/10.1142\/s179383091100105x","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3]]}}}