/prog/ - P == NP proof — Tinychan BBS

Name: Anonymous 2016-09-21 4:34

Sudoku solving is NP complete^[1]
Human brains can solve sudoku in polynomial time
There exists one example of polynomial time solving of a NP complete problem => P == NP.

^[1]http://www.cs.ox.ac.uk/people/paul.goldberg/FCS/sudoku.html

Name: Anonymous 2016-09-21 8:58

>>8
wtf are you talking about? my point is: solvers can solve sudoku quickly because the problem size is small (standard sudoku: 9x9 grid, 9 symbols, 17-20 non-empty fields). the question of NP-completeness and P-NP problem is not related to that, it's related to how this execution time (or rather number of needed steps) changes when those parameters change. how long would it take to calculate a generalized sudoku on, for example, 20x20 grid, 20 symbols and 10 non-empty fields?

P == NP proof

1 Name: Anonymous 2016-09-21 4:34

9 Name: Anonymous 2016-09-21 8:58

Name: Anonymous 2016-09-21 4:34

Name: Anonymous 2016-09-21 8:58