Year: 2025
Type: conference-paper
Abstract: The generalized Sudoku problem, with S as the set of the symbols, is known to be NP-complete and it is equivalent to any other NP-complete problem. In this paper, we present a method that solves the Sudoku Problem in polynomial time and proves that P = NP.
DOI: 10.63438/ccyx6126
Author: Nikos Dimitris Fakotakis
Institution: University of Patras
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
OpenAlex ID: W4409544621