I've formalized a topological solution to the NP-Complete Sudoku problem (generating it in O(1) without search). I argue this collapses the P vs NP barrier. Looking for rigorous critique.
[removed]
Posted Jul 20, 2026, 10:28 PM UTC
11
Comments aren't archived yet
This post had 1 comment on Reddit. Comments for this period haven't been loaded into the archive yet.