6 citations · 6 across the 1 of their papers we have counts for
1 paper
Masanori Ohya, Natsuki Masuda
In complexity theory, there exists a famous unsolved problem whether NP can be P or not. In this paper, we discuss this aspect in SAT (satisfiability) problem, and it is shown that…