New Algorithm Solves NP-Complete Sudoku Efficiently

Researchers published an algorithm that solves NP-complete Sudoku puzzles in polynomial time, challenging traditional complexity assumptions. The paper on Zenodo claims to reduce Sudoku to a tractable problem using novel mathematical techniques. If verified, this could have implications for optimization and cryptography.