The NP-completeness column: An ongoing guide

This publication has 21 references indexed in Scilit:

• A theoretical analysis of backtracking in the graph coloring problem
  Journal of Algorithms, 1985
• Input-output decomposition of dynamic systems is NP-complete
  IEEE Transactions on Automatic Control, 1984
• Backtrack: An O(1) expected time algorithm for the graph coloring problem
  Information Processing Letters, 1984
• A nonfactorial algorithm for testing isomorphism of two graphs
  Discrete Applied Mathematics, 1983
• Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
  Discrete Applied Mathematics, 1983
• The Average number of pivot steps required by the Simplex-Method is polynomial
  Mathematical Methods of Operations Research, 1982
• Average time analysis of simplified Davis-Putnam procedures
  Information Processing Letters, 1982
• Hiding information and signatures in trapdoor knapsacks
  IEEE Transactions on Information Theory, 1978
• Bounds for binary codes of length less than 25
  IEEE Transactions on Information Theory, 1978
• A note on the complexity of the chromatic number problem
  Information Processing Letters, 1976