|
|
|
|
|
|
by degamad
148 days ago
|
|
|
> The P≠NP conjecture in CS says checking a solution is easier than finding one... ... for NP-hard problems. It says nothing about the difficulty of finding or checking solutions of polynomial ("P") or exponential ("EXPTIME") problems. |
|
|