Ask data structure questions

前端 未结 0 1108
旧巷少年郎
旧巷少年郎 2020-12-29 09:12

`

Choose the correct statement(s).

(A)If we can solve a problem X with a polynomial time-complexity non-deterministic algorithm, then X is an NP problem <

相关标签:
回答
  • 消灭零回复
提交回复
热议问题