The P vs. NP problem — the biggest open question in computer science — would be impacted if Sudoku generalizations could be solved in polynomial time.
The P vs. NP problem — the biggest open question in computer science — would be impacted if Sudoku generalizations could be solved in polynomial time.
"In the confrontation between the stream and the rock, the stream always wins — not through strength, but through persistence." — Buddha
"In the confrontation between the stream and the rock, the stream always wins — not through strength, but through persistence." — Buddha