{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T18:36:56Z","timestamp":1729622216648,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/aspdac.2006.1594782","type":"proceedings-article","created":{"date-parts":[[2006,3,22]],"date-time":"2006-03-22T12:38:08Z","timestamp":1143031088000},"page":"789-795","source":"Crossref","is-referenced-by-count":0,"title":["SAT-based optimal hypergraph partitioning with replication"],"prefix":"10.1109","author":[{"given":"M.G.","family":"Wrighton","sequence":"first","affiliation":[]},{"given":"A.M.","family":"DeHon","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"year":"2002","author":"nadel","journal-title":"Backtrack Search Algorithms for Propositional Logic Satisfiability","key":"17"},{"key":"18","article-title":"An extensible SAT-solver","author":"ee?n","year":"2003","journal-title":"International Conference on Theory and Applications of Satisfiability Testing"},{"year":"0","author":"silva","key":"15"},{"doi-asserted-by":"publisher","key":"16","DOI":"10.1109\/43.273754"},{"year":"2004","author":"ryan","journal-title":"Efficient Algorithms for Clause Learning SAT Solvers","key":"13"},{"key":"14","article-title":"Efficient CNF encodings of boolean cardinality constraints","author":"bailleux","year":"2003","journal-title":"International Conference on Principles and Practice of Constraint Programming"},{"key":"11","first-page":"3\/1","article-title":"two problems-two solutions: one system-eclipse","author":"wallace","year":"1993","journal-title":"Advanced Software Technologies for Scheduling IEE Colloquium on"},{"key":"12","article-title":"Full CNF-encoding: The counting constraints case","author":"bailleux","year":"2004","journal-title":"International Conference on Theory and Applications of Satisfiability Testing"},{"year":"1979","author":"garey","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","key":"3"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1109\/43.892854"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1109\/DAC.1996.545551"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1109\/43.363121"},{"key":"7","article-title":"Multilevel K-way hypergraph partitioning","author":"karypis","year":"1999","journal-title":"Design Automation Conference"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1109\/CICC.1997.606687"},{"key":"5","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45657-0_2","article-title":"The quest for efficient boolean satisfiability solvers","author":"zhang","year":"2002","journal-title":"International Conference on Computer Aided Verification"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.1109\/ICCAD.1989.76956"},{"key":"9","doi-asserted-by":"crossref","first-page":"1221","DOI":"10.1109\/43.662685","article-title":"Minimum replication min-cut partitioning","volume":"16","author":"mak","year":"1997","journal-title":"IEEE Trans Comput Aided Design Integrated Circuits Systems"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1109\/ICCAD.2003.159757"}],"event":{"name":"Asia and South Pacific Conference on Design Automation, 2006.","location":"Yokohama, Japan"},"container-title":["Asia and South Pacific Conference on Design Automation, 2006."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10626\/33561\/01594782.pdf?arnumber=1594782","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T00:00:22Z","timestamp":1497657622000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1594782\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/aspdac.2006.1594782","relation":{},"subject":[]}}