{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T05:28:56Z","timestamp":1738387736033,"version":"3.35.0"},"reference-count":3,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1995,11,1]],"date-time":"1995-11-01T00:00:00Z","timestamp":815184000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. of Comput. Sci. & Technol."],"published-print":{"date-parts":[[1995,11]]},"DOI":"10.1007\/bf02943515","type":"journal-article","created":{"date-parts":[[2008,9,4]],"date-time":"2008-09-04T16:25:10Z","timestamp":1220545510000},"page":"569-573","source":"Crossref","is-referenced-by-count":0,"title":["A new method of solving kernels in algebraic decomposition for the synthesis of logic cell array"],"prefix":"10.1007","volume":"10","author":[{"given":"Guangsheng","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongwei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaobin","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02943515_CR1","unstructured":"Brayton R K, McMullen C T. The decomposition and factorization of Boolean expressions. InProceedings of International Symposium on Circuits and Systems, 1982, pp.49\u201354."},{"key":"BF02943515_CR2","unstructured":"Brayton R K, McMullen C T. Synthesis and optimization of multistage logic. InProceedings of International Symposium on Circuits and Systems, 1984, pp.23\u201328."},{"key":"BF02943515_CR3","doi-asserted-by":"crossref","unstructured":"Brayton R K, Sangiovanni-Vincentelli A. Logic synthesis for programmable gate arrays. In27th ACM\/IEEE Design Automation Conference, 1990, pp.620\u2013625.","DOI":"10.1145\/123186.123421"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02943515.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02943515\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02943515","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T20:43:11Z","timestamp":1738356191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02943515"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,11]]},"references-count":3,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1995,11]]}},"alternative-id":["BF02943515"],"URL":"https:\/\/doi.org\/10.1007\/bf02943515","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"type":"print","value":"1000-9000"},{"type":"electronic","value":"1860-4749"}],"subject":[],"published":{"date-parts":[[1995,11]]}}}