{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,11]],"date-time":"2022-04-11T08:30:57Z","timestamp":1649665857306},"reference-count":32,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1985,6,1]],"date-time":"1985-06-01T00:00:00Z","timestamp":486432000000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1985,6]]},"DOI":"10.1016\/0196-6774(85)90046-x","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"291-305","source":"Crossref","is-referenced-by-count":14,"title":["The NP-completeness column: An ongoing guide"],"prefix":"10.1016","volume":"6","author":[{"given":"David S","family":"Johnson","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(85)90046-X_BIB1","series-title":"Proceedings 9th Ann. ACM Symp. on Theory of Computing","first-page":"151","article-title":"Reducibility, randomness and intractability","author":"Adleman","year":"1977"},{"key":"10.1016\/0196-6774(85)90046-X_BIB2","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/S0019-9958(82)90439-9","article-title":"On the unique satisfiability problem","volume":"55","author":"Blass","year":"1982","journal-title":"Information and Control"},{"key":"10.1016\/0196-6774(85)90046-X_BIB3","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1109\/TIT.1979.1056010","article-title":"A note on the complexity of cryptography","author":"Brassard","year":"1979","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0196-6774(85)90046-X_BIB4","series-title":"Proceedings 20th Ann. Symp. on Foundations of Computer Science","first-page":"383","article-title":"Relativized cryptography","author":"Brassard","year":"1979"},{"key":"10.1016\/0196-6774(85)90046-X_BIB5","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/0022-0000(81)90034-9","article-title":"A time-luck tradeoff in relativized cryptography","volume":"22","author":"Brassard","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0196-6774(85)90046-X_BIB6","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","article-title":"New directions in cryptography","author":"Diffie","year":"1976","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0196-6774(85)90046-X_BIB7","series-title":"On the complexity of uniqueness problems","author":"Edwards","year":"1983"},{"key":"10.1016\/0196-6774(85)90046-X_BIB8","first-page":"159","article-title":"The complexity of promise problems with applications to public-key cryptography","volume":"61","author":"Even","year":"1984","journal-title":"Inform. Proces. Lett."},{"key":"10.1016\/0196-6774(85)90046-X_BIB9","series-title":"Automata, Languages, and Programming","first-page":"195","article-title":"Cryptography and NP-completeness","volume":"Vol. 85","author":"Even","year":"1980"},{"key":"10.1016\/0196-6774(85)90046-X_BIB10","doi-asserted-by":"crossref","unstructured":"J. Geske and J. Grollman, Relativizations of unambiguous and random polynomial time classes, SIAM J. Comput., to appear. Unseen paper, cited in [12].","DOI":"10.1137\/0215035"},{"key":"10.1016\/0196-6774(85)90046-X_BIB11","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0196-6774(85)90046-X_BIB12","series-title":"Proceedings 25th Ann. Symp. on Foundations of Computer Science","first-page":"495","article-title":"Complexity measures for public-key cryptosystems","author":"Grollman","year":"1984"},{"key":"10.1016\/0196-6774(85)90046-X_BIB13","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","article-title":"The ellipsoid method and its consequences in combinatorial optimization","volume":"1","author":"Gr\u00f6tschel","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/0196-6774(85)90046-X_BIB14","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0196-6774(85)90046-X_BIB15","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","article-title":"The NP-completeness of edge coloring","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(85)90046-X_BIB16","unstructured":"M. Krentel, private communication (1985)."},{"key":"10.1016\/0196-6774(85)90046-X_BIB17","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0196-6774(83)90032-9","article-title":"NP-completeness of finding the chromatic index of regular graphs","volume":"4","author":"Leven","year":"1983","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(85)90046-X_BIB18","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","article-title":"Hiding information and signatures in trapdoor knapsacks","author":"Merkle","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0196-6774(85)90046-X_BIB19","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1145\/62.322435","article-title":"On the complexity of unique solutions","volume":"31","author":"Papadimitriou","year":"1984","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(85)90046-X_BIB20","series-title":"Proceedings 8th Ann. ACM Symp. on Theory of Computing","first-page":"1","article-title":"Some complexity results for the traveling salesman problem","author":"Papadimitriou","year":"1976"},{"key":"10.1016\/0196-6774(85)90046-X_BIB21","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0022-0000(84)90068-0","article-title":"The complexity of facets (and some facets of complexity)","volume":"28","author":"Papadimitriou","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0196-6774(85)90046-X_BIB22","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0204018","article-title":"Every prime has a succinct certificate","volume":"4","author":"Pratt","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(85)90046-X_BIB23","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/322290.322306","article-title":"Relativized questions involving probabilistic computations","volume":"29","author":"Rackoff","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(85)90046-X_BIB24","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","article-title":"A method for obtaining digital signatures and public-key cryptosystems","volume":"21","author":"Rivest","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0196-6774(85)90046-X_BIB25","article-title":"On Some Central Problems in Computational Complexity","author":"Simon","year":"1975"},{"key":"10.1016\/0196-6774(85)90046-X_BIB26","series-title":"Automata, Languages, and Programming","first-page":"480","article-title":"On the difference between one and many","volume":"Vol. 52","author":"Simon","year":"1977"},{"key":"10.1016\/0196-6774(85)90046-X_BIB27","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/S0167-5060(08)70511-9","article-title":"Hamiltonian cycles and uniquely edge colourable graphs","volume":"3","author":"Thomason","year":"1978","journal-title":"Annals Disc. Math."},{"key":"10.1016\/0196-6774(85)90046-X_BIB28","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0020-0190(76)90097-1","article-title":"Relative complexity of checking and evaluating","volume":"5","author":"Valiant","year":"1976","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(85)90046-X_BIB29","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"8","author":"Valiant","year":"1979","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/0196-6774(85)90046-X_BIB30","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","article-title":"The complexity of enumeration and reliability problems","volume":"8","author":"Valiant","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(85)90046-X_BIB31","series-title":"Proceedings 17th Ann. ACM Symp. on Theory of Computing","article-title":"NP is as easy as detecting unique solutions","author":"Valiant","year":"1985"},{"key":"10.1016\/0196-6774(85)90046-X_BIB32","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0304-3975(83)90004-X","article-title":"A natural encoding scheme proved probabilistic polynomial complete","volume":"24","author":"Vazirani","year":"1983","journal-title":"Theor. Comput. Sci."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667748590046X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667748590046X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:26:14Z","timestamp":1548743174000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/019667748590046X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,6]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,6]]}},"alternative-id":["019667748590046X"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(85)90046-x","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1985,6]]}}}