2 citations · 3 across the 3 of their papers we have counts for
1 paper · 1 filter
Keum-Bae Cho
This paper solves a long standing open problem of whether NP-complete problems could be solved in polynomial time on a deterministic Turing machine by showing that the indistinguis…