{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:35:22Z","timestamp":1725521722809},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540921813"},{"type":"electronic","value":"9783540921820"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92182-0_52","type":"book-chapter","created":{"date-parts":[[2008,12,9]],"date-time":"2008-12-09T21:38:06Z","timestamp":1228858686000},"page":"580-591","source":"Crossref","is-referenced-by-count":1,"title":["The Complexity of SPP Formula Minimization"],"prefix":"10.1007","author":[{"given":"David","family":"Buchfuhrer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"52_CR1","doi-asserted-by":"crossref","unstructured":"Bernasconi, A., Ciriani, V., Drechsler, R., Villa, T.: Logic minimization and testability of 2-SPP networks. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (to appear, 2008)","DOI":"10.1109\/TCAD.2008.923072"},{"issue":"8","key":"52_CR2","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Computers\u00a035(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Computers"},{"key":"52_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-540-70575-8_3","volume-title":"Automata, Languages and Programming","author":"D. Buchfuhrer","year":"2008","unstructured":"Buchfuhrer, D., Umans, C.: The complexity of Boolean formula minimization. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 24\u201335. Springer, Heidelberg (2008)"},{"key":"52_CR4","unstructured":"Ciriani, V., Bernasconi, A.: 2-SPP: a practical trade-off between SP and SPP synthesis. In: 5th International Workshop on Boolean Problems (IWSBP 2002), pp. 133\u2013140 (2002)"},{"issue":"10","key":"52_CR5","doi-asserted-by":"publisher","first-page":"1310","DOI":"10.1109\/TCAD.2003.818121","volume":"22","author":"V. Ciriani","year":"2003","unstructured":"Ciriani, V.: Synthesis of SPP three-level logic networks using affine spaces. IEEE Trans. on CAD of Integrated Circuits and Systems\u00a022(10), 1310\u20131323 (2003)","journal-title":"IEEE Trans. on CAD of Integrated Circuits and Systems"},{"issue":"6","key":"52_CR6","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1016\/j.ic.2008.03.002","volume":"206","author":"J. Goldsmith","year":"2008","unstructured":"Goldsmith, J., Hagen, M., Mundhenk, M.: Complexity of DNF minimization and isomorphism testing for monotone formulas. Information and Computation\u00a0206(6), 760\u2013775 (2008)","journal-title":"Information and Computation"},{"key":"52_CR7","first-page":"514","volume-title":"VLSI Design","author":"J. Jacob","year":"1997","unstructured":"Jacob, J., Sivakumar, P.S., Agrawal, V.D.: Adder and comparator synthesis with exclusive-or transform of inputs. In: VLSI Design, pp. 514\u2013515. IEEE Computer Society, Los Alamitos (1997)"},{"issue":"3","key":"52_CR8","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1109\/12.754996","volume":"48","author":"F. Luccio","year":"1999","unstructured":"Luccio, F., Pagli, L.: On a new Boolean function with applications. IEEE Trans. Computers\u00a048(3), 296\u2013310 (1999)","journal-title":"IEEE Trans. Computers"},{"key":"52_CR9","doi-asserted-by":"crossref","unstructured":"Umans, C.: The minimum equivalent DNF problem and shortest implicants. In: FOCS, pp. 556\u2013563 (1998)","DOI":"10.1109\/SFCS.1998.743506"},{"key":"52_CR10","unstructured":"Umans, C.: Hardness of approximating \n                    \n                      \n                    \n                    $\\Sigma_{2}^{p}$\n                   minimization problems. In: FOCS, pp. 465\u2013474 (1999)"},{"issue":"4","key":"52_CR11","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1006\/jcss.2001.1775","volume":"63","author":"C. Umans","year":"2001","unstructured":"Umans, C.: The minimum equivalent DNF problem and shortest implicants. J. Comput. Syst. Sci.\u00a063(4), 597\u2013611 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"7","key":"52_CR12","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/TCAD.2005.855944","volume":"25","author":"C. Umans","year":"2006","unstructured":"Umans, C., Villa, T., Sangiovanni-Vincentelli, A.L.: Complexity of two-level logic minimization. IEEE Trans. on CAD of Integrated Circuits and Systems\u00a025(7), 1230\u20131246 (2006)","journal-title":"IEEE Trans. on CAD of Integrated Circuits and Systems"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92182-0_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T05:28:45Z","timestamp":1551677325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92182-0_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921813","9783540921820"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92182-0_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}