NP完全问题讲解.pptVIP

Fall 2006 Costas Busch - RPI NP-complete Languages Polynomial Time Reductions Size of : makes sure that the computation leads to acceptance An accept state should appear somewhere in the tableau Accepting states Size of : makes sure that the tableau gives a valid sequence of configurations is expressed in terms of legal windows Tableau Window 2x6 area of cells * Polynomial Computable function : such that for any string computes in polynomial time: There is a deterministic Turing machine since, cannot use more than tape space in ti