{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:04:45Z","timestamp":1725494685345},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540674429"},{"type":"electronic","value":"9783540455912"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45591-4_130","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T05:18:03Z","timestamp":1195017483000},"page":"951-958","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Complexity Bounds for Lookup Table Implementation of Factored Forms in FPGA Technology Mapping"],"prefix":"10.1007","author":[{"given":"Wen yi","family":"Feng","sequence":"first","affiliation":[]},{"given":"Fred J.","family":"Meyer","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Lombardi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,5,25]]},"reference":[{"key":"130_CR1","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1109\/TCAD.1987.1270347","volume":"6","author":"R. K. Brayton","year":"1987","unstructured":"Brayton, R. K., Rudell, R., Sangiovanni-Vincentelli, A.: Mis: A multiple-level logic optimization system. IEEE Trans. CAD of Int. Circ. and Sys. 6 (1987) 1062\u20131081","journal-title":"IEEE Trans. CAD of Int. Circ. and Sys."},{"key":"130_CR2","unstructured":"Chan, P. K., Zien, J. Y., Schlag, M.: On routability prediction of FPGAs. IEEE\/ACM Des. Auto. Conf. (1993) 326\u2013330"},{"key":"130_CR3","unstructured":"Chaudhary, K., Pedram, M.: A near optimal technology mapping minimizing area under delay constraints. IEEE\/ACM Des. Auto. Conf. (1992) 492\u2013498"},{"key":"130_CR4","unstructured":"Cong, J., Ding, Y.: On area\/depth trade-off in LUT-based FPGA technology mapping. IEEE\/ACM Des. Auto. Conf. (1993) 213\u2013218"},{"key":"130_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/43.273754","volume":"13","author":"J. Cong","year":"1994","unstructured":"Cong, J., Ding, Y.: Flowmap: An optimal technology mapping algorithm for delay optimization in look-up table based FPGA designs. IEEE Trans. CAD of Int. Circ. and Sys. 13 (1994) 1\u201312","journal-title":"IEEE Trans. CAD of Int. Circ. and Sys."},{"key":"130_CR6","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1109\/43.329262","volume":"13","author":"A. H. Farrahi","year":"1994","unstructured":"Farrahi, A. H., Sarrafzadeh, M.: Complexity of the look-up table minimization problem for FPGA technology mapping. IEEE Trans. CAD of Int. Circ. and Sys. 13 (1994) 1319\u20131332","journal-title":"IEEE Trans. CAD of Int. Circ. and Sys."},{"key":"130_CR7","unstructured":"Francis, R. J., Rose, J., Chung, K.: Chortle: A technology mapping algorithm for lookup table based FPGAs. IEEE\/ACM Des. Auto. Conf. (1990) 613\u2013619"},{"key":"130_CR8","unstructured":"Francis, R. J., Rose, J., Vranesic, Z.: Chortle-crf: Fast technology mapping for lookup table based FPGAs. IEEE\/ACM Des. Auto. Conf. (1991) 227\u2013233"},{"key":"130_CR9","unstructured":"Murgai, R., Brayton, R. K., Sangiovanni-Vincentelli, A.: Logic Synthesis for FPGAs. Kluwer Academic Publishers (1995)"},{"key":"130_CR10","unstructured":"Murgai, R., Nishizaki, Y., Shenoy, N., Brayton, R. K., Sangiovanni-Vincentelli, A.: Logic synthesis algorithms for programmable gate arrays. IEEE\/ACM Des. Auto. Conf. (1990) 620\u2013625"},{"key":"130_CR11","unstructured":"Schlag, M., Kong, J., Chan, P. K.: Routability driven technology mapping for look-up table FPGAs. IEEE Int. Conf. Comp. Des. (1992) 89\u201390"},{"key":"130_CR12","doi-asserted-by":"crossref","unstructured":"Wegener, I.: The Complexity of Boolean Functions. Wiley-Teubner (1987)","DOI":"10.1007\/3-540-18170-9_185"},{"key":"130_CR13","unstructured":"Xilinx Corporation: Xilinx FPGA Data Book. (1996)"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45591-4_130","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T05:12:56Z","timestamp":1586149976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45591-4_130"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540674429","9783540455912"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45591-4_130","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"25 May 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}