Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

P == NP proof

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-23 20:49

███████ ████████ ██ ██ ████████ ██████ ██ ██ ████████ ██████████
████ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██
██ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██
██ ██ ██ ██ ██ ██ ██ ████ ██ ██ ██ ██
██ ██ ██████ ████████ ██ ████ ████████ ██ ██ ██
██ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██
██ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██
████████ ██ ██ ████████ ██████ ██ ██ ██ ██ ██ ██
████████ ██ ██ ████████ ██████ ██ ██ ████████ ██ ██ ██

Newer Posts
Don't change these.
Name: Email:
Entire Thread Thread List