Submit your work, meet writers and drop the ads. Become a member
Dec 2023
So a polynomial-time solution to Sudoku leads, by a series of mechanical transformations, to a polynomial time solution of satisfiability, which in turn can be used to solve any other NP-problem in polynomial time. Using transformations like this, a vast class of seemingly unrelated problems are all reducible to one another, and are in a sense "the same problem".
nvinn   fonia
Written by
nvinn fonia  45/M
(45/M)   
  175
 
Please log in to view and add comments on poems