{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T04:36:41Z","timestamp":1710391001482},"reference-count":14,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[1986,7,1]],"date-time":"1986-07-01T00:00:00Z","timestamp":520560000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."],"published-print":{"date-parts":[[1986,7]]},"DOI":"10.1109\/tcad.1986.1270213","type":"journal-article","created":{"date-parts":[[2004,4,29]],"date-time":"2004-04-29T00:28:59Z","timestamp":1083198539000},"page":"433-442","source":"Crossref","is-referenced-by-count":30,"title":["A Best-First Search Algorithm for Optimal PLA Folding"],"prefix":"10.1109","volume":"5","author":[{"family":"Sun Young Hwang","sequence":"first","affiliation":[]},{"given":"R.W.","family":"Dutton","sequence":"additional","affiliation":[]},{"given":"T.","family":"Blank","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","author":"hwang","year":"1986","journal-title":"A best-first search algorithm for optimal PLA folding and its implementation on Virtual Bit Map processor"},{"key":"ref11","author":"karp","year":"1976","journal-title":"The probabilistic analysis of some combinatorial search algorithms"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1984.1585832"},{"key":"ref13","author":"papadimitriou","year":"1982","journal-title":"Combinatorial Optimization Algorithm and Complexity"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(76)90068-6"},{"key":"ref4","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref3","author":"even","year":"1979","journal-title":"Graph Algorithms"},{"key":"ref6","first-page":"1023","article-title":"Some results in optimal PLA folding","author":"hachtel","year":"1980","journal-title":"Proc Int Circuits Comp Conf"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1982.1585492"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1982.1585494"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.1982.1269996"},{"key":"ref2","author":"aho","year":"1983","journal-title":"Data Structures and Algorithm"},{"key":"ref1","author":"aho","year":"1974","journal-title":"The Design and Analysis of Computer Algorithms"},{"key":"ref9","author":"horowitz","year":"1978","journal-title":"Fundamentals of Computer Algorithms"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/43\/28437\/01270213.pdf?arnumber=1270213","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:39:44Z","timestamp":1638218384000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1270213\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,7]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,7]]}},"URL":"https:\/\/doi.org\/10.1109\/tcad.1986.1270213","relation":{},"ISSN":["0278-0070"],"issn-type":[{"value":"0278-0070","type":"print"}],"subject":[],"published":{"date-parts":[[1986,7]]}}}