Informally, an NP-complete problem is an NP problem that is at least as "tough" as any other problem in NP.
An NP-Complete problem is at least as difficult to solve as any other NP problem.
An NP-Complete problem is at least as difficult to solve as any other NP problem.
この段落を簡略化してください: Informally, an NP-complete problem is an NP problem that is at least as "tough" as any other problem in NP. 出力: