{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T08:34:13Z","timestamp":1725698053227},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1109\/vlsi-soc.2018.8644855","type":"proceedings-article","created":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T12:33:26Z","timestamp":1552653206000},"page":"137-142","source":"Crossref","is-referenced-by-count":3,"title":["Two Combinatorial Problems on the Layout of Switching Lattices"],"prefix":"10.1109","author":[{"given":"Anna","family":"Bernasconi","sequence":"first","affiliation":[]},{"given":"Antonio","family":"Boffa","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Luccio","sequence":"additional","affiliation":[]},{"given":"Linda","family":"Pagli","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.907068"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2011.170"},{"key":"ref10","first-page":"168","article-title":"Finding a shortest solution for the N × N extension of the 15-puzzle is intractable","author":"ratner","year":"1986","journal-title":"Proceedings of the 5th National Conference on Artificial Intelligence Philadelphia PA August 11-15 1986 Volume 1 Science"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2661632"},{"journal-title":"Artificial Intelligence A Modern Approach 2nd ed","year":"2003","author":"russell","key":"ref11"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50106-2_32"},{"key":"ref12","article-title":"Logic Synthesis and Optimization Benchmarks User Guide Version 3.0","author":"yang","year":"1991","journal-title":"User Guide Microelectronic Center"},{"key":"ref8","article-title":"The MPA graph problem: definition and basic properties","author":"luccio","year":"2018","journal-title":"Technical Report Department of Information Engineering University of Pisa"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1837274.1837423"},{"journal-title":"Synthesis and Optimization of Switching Theory","year":"1994","author":"micheli","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1972.5009040"}],"event":{"name":"2018 IFIP\/IEEE International Conference on Very Large Scale Integration (VLSI-SoC)","start":{"date-parts":[[2018,10,8]]},"location":"Verona, Italy","end":{"date-parts":[[2018,10,10]]}},"container-title":["2018 IFIP\/IEEE International Conference on Very Large Scale Integration (VLSI-SoC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8642560\/8644718\/08644855.pdf?arnumber=8644855","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T23:26:52Z","timestamp":1598225212000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8644855\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/vlsi-soc.2018.8644855","relation":{},"subject":[],"published":{"date-parts":[[2018,10]]}}}