{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T04:26:09Z","timestamp":1683001569887},"reference-count":44,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1984,6,1]],"date-time":"1984-06-01T00:00:00Z","timestamp":454896000000},"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":[[1984,6]]},"DOI":"10.1016\/0196-6774(84)90032-4","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"284-299","source":"Crossref","is-referenced-by-count":48,"title":["The NP-completeness column: An ongoing guide"],"prefix":"10.1016","volume":"5","author":[{"given":"David S","family":"Johnson","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(84)90032-4_BIB1","series-title":"Proceedings 16th Ann. ACM Symp. on Theory of Computing","article-title":"A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension","author":"Adler","year":"1984"},{"key":"10.1016\/0196-6774(84)90032-4_BIB2","series-title":"Proceedings 9th Ann. ACM Symp. on Theory of Computing","first-page":"30","article-title":"Fast probabilistic algorithms for Hamiltonian circuits and matchings","author":"Angluin","year":"1977"},{"key":"10.1016\/0196-6774(84)90032-4_BIB3","series-title":"Proceedings 20th Ann. Symp. on Foundations of Computer Science","first-page":"39","article-title":"Canonical labelling of graphs in linear time","author":"Babai","year":"1979"},{"key":"10.1016\/0196-6774(84)90032-4_BIB4","doi-asserted-by":"crossref","unstructured":"E. A. Bender and H. S. Wilf, A theoretical analysis of backtracking in the graph coloring problem. J. Algorithms, to appear.","DOI":"10.1016\/0196-6774(85)90044-6"},{"key":"10.1016\/0196-6774(84)90032-4_BIB5","series-title":"Proceedings 21st Ann. Allerton Conf. on Communication, Control, and Computing","first-page":"51","article-title":"An experimental study of bin packing","author":"Bentley","year":"1983"},{"key":"10.1016\/0196-6774(84)90032-4_BIB6","series-title":"Proceedings 16th Ann. ACM Symp. on Theory of Computing","article-title":"Some unexpected expected behavior results for bin packing","author":"Bentley","year":"1984"},{"key":"10.1016\/0196-6774(84)90032-4_BIB7","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","article-title":"On isomorphism and density of NP and other complete sets","volume":"6","author":"Berman","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(84)90032-4_BIB8","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/TIT.1978.1055827","article-title":"Bounds for binary codes of length less than 25","author":"Best","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0196-6774(84)90032-4_BIB9","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01917108","article-title":"The average number of steps required by the simplex method is polynomial","volume":"26","author":"Borgwardt","year":"1982","journal-title":"Zeitschrift f\u00fcr Oper. Res."},{"key":"10.1016\/0196-6774(84)90032-4_BIB10","first-page":"145","article-title":"Are most low density knapsacks solvable in polynomial time?","volume":"39","author":"Brickell","year":"1983","journal-title":"Congressus Numerantium"},{"key":"10.1016\/0196-6774(84)90032-4_BIB11","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0095-8956(72)90020-2","article-title":"On Hamilton's ideals","volume":"12","author":"Chv\u00e1tal","year":"1972","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"10.1016\/0196-6774(84)90032-4_BIB12","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1137\/0206046","article-title":"Determining the stability number of a graph","volume":"6","author":"Chv\u00e1tal","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(84)90032-4_BIB13","doi-asserted-by":"crossref","first-page":"1402","DOI":"10.1287\/opre.28.6.1402","article-title":"Hard knapsack problems","volume":"28","author":"Chv\u00e1tal","year":"1980","journal-title":"Operations Res."},{"key":"10.1016\/0196-6774(84)90032-4_BIB14","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","article-title":"A machine program for theorem proving","volume":"5","author":"Davis","year":"1962","journal-title":"Comm. ACM"},{"key":"10.1016\/0196-6774(84)90032-4_BIB15","first-page":"305","article-title":"Average-time testing of satisfiability algorithms","volume":"39","author":"Dewdney","year":"1983","journal-title":"Congressus Numerantium"},{"key":"10.1016\/0196-6774(84)90032-4_BIB16","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs I","volume":"6","author":"Erd\u00f6s","year":"1959","journal-title":"Publicationes Mathematicae"},{"key":"10.1016\/0196-6774(84)90032-4_BIB17","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0166-218X(83)90017-3","article-title":"Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem","volume":"5","author":"Franco","year":"1983","journal-title":"Disc. Applied Math."},{"key":"10.1016\/0196-6774(84)90032-4_BIB18","article-title":"On the complexity of the satisfiability problem","author":"Goldberg","year":"1979"},{"key":"10.1016\/0196-6774(84)90032-4_BIB19_1","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/0020-0190(82)90110-7","article-title":"Average time analysis of simplified Davis-Putnam procedures","volume":"15","author":"Goldberg","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(84)90032-4_BIB19_2","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0020-0190(83)90127-8","volume":"16","author":"Goldberg","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(84)90032-4_BIB20","series-title":"Proceedings 16th Ann. ACM Symp. on Theory of Computing","article-title":"On finding the exact solution of a zero-one knapsack problem","author":"Goldberg","year":"1984"},{"key":"10.1016\/0196-6774(84)90032-4_BIB21","doi-asserted-by":"crossref","unstructured":"M. K. Goldberg, A nonfactorial algorithm for testing isomorphism of two graphs, Disc. Applied Math., to appear.","DOI":"10.1016\/0166-218X(83)90078-1"},{"key":"10.1016\/0196-6774(84)90032-4_BIB22","series-title":"The simplex algorithm is very good! \u2014 On the expected number of pivot steps and related properties of random linear programs","author":"Haimovich","year":"1983"},{"key":"10.1016\/0196-6774(84)90032-4_BIB23","first-page":"196","article-title":"A dynamic programming approach to sequencing problems","volume":"10","author":"Held","year":"1962","journal-title":"SIAM J."},{"key":"10.1016\/0196-6774(84)90032-4_BIB24","series-title":"Proceedings 16th Ann. ACM Symp. on Theory of Computing","article-title":"A new polynomial-time algorithm for linear programming","author":"Karmarkar","year":"1984"},{"key":"10.1016\/0196-6774(84)90032-4_BIB25","series-title":"Algorithms and Complexity: New Directions and Recent Results","first-page":"1","article-title":"The probabilistic analysis of some combinatorial search algorithms","author":"Karp","year":"1976"},{"key":"10.1016\/0196-6774(84)90032-4_BIB26","series-title":"Advances in Cryptography: Proc. of CRYPTO-83","first-page":"3","article-title":"Knapsack-type public key cryptosystems and Diophantine approximation","author":"Lagarias","year":"1984"},{"key":"10.1016\/0196-6774(84)90032-4_BIB27","series-title":"Proceedings 24th Ann. Symp. on Foundations of Computer Science","first-page":"1","article-title":"Solving low-density subset sum problems","author":"Lagarias","year":"1983"},{"key":"10.1016\/0196-6774(84)90032-4_BIB28","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/0020-0190(76)90065-X","article-title":"A note on the complexity of the chromatic number problem","volume":"5","author":"Lawler","year":"1976","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(84)90032-4_BIB29","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","article-title":"Factoring polynomials with rational coefficients","volume":"261","author":"Lenstra","year":"1982","journal-title":"Math. Annalen"},{"key":"10.1016\/0196-6774(84)90032-4_BIB30_1","first-page":"115","article-title":"Universal sorting problems","volume":"9","author":"Levin","year":"1973","journal-title":"Problemy Peredaci Informacii"},{"key":"10.1016\/0196-6774(84)90032-4_BIB30_2","first-page":"265","volume":"9","author":"Levin","year":"1973","journal-title":"Problems of Information Transmission"},{"key":"10.1016\/0196-6774(84)90032-4_BIB31","series-title":"Proceedings 16th Ann. ACM Symp. on Theory of Computing","article-title":"Problems, complete in \u201caverage\u201d instance","author":"Levin","year":"1984"},{"key":"10.1016\/0196-6774(84)90032-4_BIB32","unstructured":"L. A. Levin, private communication (1984)."},{"key":"10.1016\/0196-6774(84)90032-4_BIB33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0208001","article-title":"Determining the chromatic number of a graph","volume":"8","author":"McDiarmid","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(84)90032-4_BIB34","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(84)90032-4_BIB35","first-page":"197","article-title":"A graph-theoretic algorithm for hierarchical decomposition of dynamic systems with applications to estimation and control","author":"Pichai","year":"1983","journal-title":"IEEE Transactions"},{"key":"10.1016\/0196-6774(84)90032-4_BIB36","unstructured":"V. Pichai, M. E. Sezer, and D. D. Siljak, Author's reply on \u201cInput-output decomposition of dynamic systems in NP-complete\u201d, IEEE Trans. Automat. Contr., to appear."},{"key":"10.1016\/0196-6774(84)90032-4_BIB37","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0012-365X(76)90068-6","article-title":"Hamiltonian circuits in random graphs","volume":"14","author":"P\u00f3sa","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0196-6774(84)90032-4_BIB38","series-title":"Proceedings 23rd Ann. Symp. on Foundations of Computer Science","first-page":"145","article-title":"A polynomial algorithm for breaking the basic Merkle-Hellman cryptosystem","author":"Shamir","year":"1982"},{"key":"10.1016\/0196-6774(84)90032-4_BIB39","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF02591902","article-title":"On the average number of steps of the simplex method of linear programming","volume":"27","author":"Smale","year":"1983","journal-title":"Math. Programming"},{"key":"10.1016\/0196-6774(84)90032-4_BIB40","doi-asserted-by":"crossref","unstructured":"R. E. Tarjan, Input-output decomposition of dynamic systems is NP-complete, IEEE Trans. Automat. Contr., to appear.","DOI":"10.1109\/TAC.1984.1103657"},{"key":"10.1016\/0196-6774(84)90032-4_BIB41","article-title":"Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems","author":"Todd","year":"1983"},{"key":"10.1016\/0196-6774(84)90032-4_BIB42","doi-asserted-by":"crossref","unstructured":"H. S. Wilf, Backtrack: An O(1) expected time graph coloring algorithm, Inform. Process. Lett., to appear.","DOI":"10.1016\/0020-0190(84)90013-9"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677484900324?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677484900324?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T03:56:53Z","timestamp":1682999813000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677484900324"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,6]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,6]]}},"alternative-id":["0196677484900324"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(84)90032-4","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1984,6]]}}}