{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T12:17:06Z","timestamp":1783081026878,"version":"3.54.6"},"reference-count":14,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J CIRCUIT SYST COMP"],"published-print":{"date-parts":[[2014,1]]},"abstract":"<jats:p> Two parallel algorithms are proposed in this paper for solving the problem of finding exact exclusive-or sum of products (ESOP) expressions for an arbitrary Boolean function. This minimization problem is a very difficult one and solutions have been proposed only for up to seven variables. The processing time for some symmetric functions of seven variables is of the order of weeks. The proposed algorithm is a hybrid one (OpenMP, MPI) and a speed-up of more than nine could be achieved, for a cluster of three nodes with four cores each. <\/jats:p>","DOI":"10.1142\/s0218126614500157","type":"journal-article","created":{"date-parts":[[2013,12,16]],"date-time":"2013-12-16T08:46:04Z","timestamp":1387183564000},"page":"1450015","source":"Crossref","is-referenced-by-count":7,"title":["A PARALLEL ALGORITHM FOR MINIMIZING ESOP EXPRESSIONS"],"prefix":"10.1142","volume":"23","author":[{"given":"GEORGE","family":"PAPAKONSTANTINOU","sequence":"first","affiliation":[{"name":"School of Electrical and Computer Engineering, National Technical University of Athens, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2014,2,5]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1109\/12.45212"},{"key":"rf3","first-page":"163","volume":"28","author":"Papakonstantinou G.","journal-title":"IEEE Trans. Comput."},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1080\/00207218108901248"},{"key":"rf6","first-page":"1226","volume":"87","author":"Stergiou S.","journal-title":"IEICE Trans. Fund. E"},{"key":"rf7","first-page":"2708","volume":"85","author":"Hirayama T.","journal-title":"IEICE Trans. Fund. E"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1142\/S0218126609005356"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1142\/S0218126604001295"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1109\/43.277608"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1109\/43.494702"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1016\/j.vlsi.2011.10.001"},{"key":"rf15","volume-title":"Parallel Programming","author":"Wilkinson B.","year":"2005"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1080\/00036810600595813"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2013.43"},{"key":"rf18","volume-title":"Switching Theory for Logic Synthesis","author":"Sasao T.","year":"2000"}],"container-title":["Journal of Circuits, Systems and Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218126614500157","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:46:32Z","timestamp":1565109992000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218126614500157"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1]]},"references-count":14,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2014,2,5]]},"published-print":{"date-parts":[[2014,1]]}},"alternative-id":["10.1142\/S0218126614500157"],"URL":"https:\/\/doi.org\/10.1142\/s0218126614500157","relation":{},"ISSN":["0218-1266","1793-6454"],"issn-type":[{"value":"0218-1266","type":"print"},{"value":"1793-6454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1]]}}}