您要查找的是不是：
- 一個(gè)NP-完全問(wèn)題AN NP-COMPLETE PROBLEM
- 合取范式可滿(mǎn)足性問(wèn)題(簡(jiǎn)稱(chēng)SAT問(wèn)題)是一個(gè)NP完全問(wèn)題。The satisfiability problem of conjunction normal form (abbreviate SAT problem) is an NP_complete problem.
- 能量因素與QoS各參數的相互影響構成了一個(gè)NP完全問(wèn)題.A NP-Complete problem occurs when the energy factors and the QoS parameters influence each other.
- 旅行商問(wèn)題(TSP)是一個(gè)有著(zhù)重要工程背景、在圖論中的典型組合優(yōu)化問(wèn)題，已被證實(shí)是一個(gè)NP完全問(wèn)題。The Traveling Salesman Problem (TSP) is a typical optimization problem, which belongs to a large family of problems classified as NP-complete. It has the important project background.
- 查找下一個(gè)find next
- 沒(méi)問(wèn)題No problem.
- 每一個(gè)every last
- 不完全imperfectness
- 安全問(wèn)題safety issue
- 沒(méi)有一個(gè)neither one
- 另外一個(gè)other
- 不完全的lame
- 沒(méi)有問(wèn)題all serene
- 哪一個(gè)which
- 常見(jiàn)問(wèn)題FAQ
- 出現問(wèn)題go wrong
- 某一個(gè)some or other
- 不是一個(gè)而是兩個(gè)！Not one, but two!
- 重要問(wèn)題an important issue
- "董事長(cháng)今天要來(lái)倉庫參觀(guān)，所以你們要小心點(diǎn)，準備回答任何問(wèn)題。""The Chairman's visiting the ware house today, so keep on your toes and be ready to answer any questions."
