{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T04:03:41Z","timestamp":1777176221520,"version":"3.51.4"},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1987,11,1]],"date-time":"1987-11-01T00:00:00Z","timestamp":562723200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1987,11]]},"DOI":"10.1016\/0020-0190(87)90054-8","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T14:05:40Z","timestamp":1034085940000},"page":"157-162","source":"Crossref","is-referenced-by-count":59,"title":["Nonconstructive advances in polynomial-time complexity"],"prefix":"10.1016","volume":"26","author":[{"given":"Michael R.","family":"Fellows","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael A.","family":"Langston","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(87)90054-8_BIB1","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1109\/TCAD.1987.1270248","article-title":"Exact and approximate solutions for the gate matrix layout problem","volume":"6","author":"Deo","year":"1987","journal-title":"IEEE Trans. Computer Aided Design"},{"key":"10.1016\/0020-0190(87)90054-8_BIB2","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(87)90054-8_BIB3","series-title":"Fundamentals of Computer Algorithms","author":"Horowitz","year":"1984"},{"key":"10.1016\/0020-0190(87)90054-8_BIB4","unstructured":"D. Hwang, W. Fuchs and S. Kang, An efficient approach to gate matrix layout, IEEE Internat. Conf. on Computer-Aided Design, to appear."},{"key":"10.1016\/0020-0190(87)90054-8_BIB5","unstructured":"D. Hwang and H. Leong, Private communication, 1986."},{"key":"10.1016\/0020-0190(87)90054-8_BIB6","series-title":"Proc. IEEE Symp. on Circuits and Systems","first-page":"82","article-title":"An NP-complete problem on interval graphs","author":"Kashiwabara","year":"1979"},{"key":"10.1016\/0020-0190(87)90054-8_BIB7","unstructured":"H. Leong, A new algorithm for gate matrix layout, IEEE Internat. Conf. on Computer-Aided Design, to appear."},{"key":"10.1016\/0020-0190(87)90054-8_BIB8","series-title":"IEEE Internat. Symp. on Circuits and Systems","first-page":"1013","article-title":"Algorithms for gate matrix layout","author":"Li","year":"1983"},{"key":"10.1016\/0020-0190(87)90054-8_BIB9","doi-asserted-by":"crossref","first-page":"1671","DOI":"10.1109\/T-ED.1980.20086","article-title":"A dense gate matrix layout method for MOS VLSI","volume":"27","author":"Lopez","year":"1980","journal-title":"IEEE Trans. Electron. Devices"},{"key":"10.1016\/0020-0190(87)90054-8_BIB10","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/0606030","article-title":"Disjoint paths \u2014 A survey","volume":"6","author":"Robertson","year":"1985","journal-title":"SIAM J. Alg. Disc. Meths."},{"key":"10.1016\/0020-0190(87)90054-8_BIB11","series-title":"Surveys in Combinatorics","first-page":"153","article-title":"Graph minors \u2014 A survey","author":"Robertson","year":"1985"},{"key":"10.1016\/0020-0190(87)90054-8_BIB12","series-title":"Equivalents of the Axiom of Choice","author":"Rubin","year":"1985"},{"key":"10.1016\/0020-0190(87)90054-8_BIB13","unstructured":"P. Seymour, Private communication, 1986."},{"key":"10.1016\/0020-0190(87)90054-8_BIB14","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1007\/BF01594196","article-title":"Uber einer Eigenschaft der ebener Complexe","volume":"14","author":"Wagner","year":"1937","journal-title":"Math. Ann."},{"key":"10.1016\/0020-0190(87)90054-8_BIB15","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1109\/TCAD.1985.1270118","article-title":"Gate matrix layout","volume":"4","author":"Wing","year":"1985","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"10.1016\/0020-0190(87)90054-8_BIB16","article-title":"Nonconstructive Tools for Proving Polynomial-Time Decidability","author":"Fellows","year":"1986"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087900548?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087900548?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T17:32:35Z","timestamp":1554399155000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019087900548"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,11]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,11]]}},"alternative-id":["0020019087900548"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(87)90054-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1987,11]]}}}