maximal clique problem

基本解釋

• [計(jì)算機(jī)科學(xué)技術(shù)]最大集團(tuán)問(wèn)題

英漢例句

雙語(yǔ)例句

• Biomolecular computing has been successfully applied in computing NP complete problems such as Hamiltonion path problem, maximal clique problem and SAT problems in Boolean calculation, etc.
  生物分子計(jì)算已成功地應(yīng)用於計(jì)算 哈密 頓 路逕、最大集郃以及邏輯運(yùn)算中的SAT類(lèi)問(wèn)題等 NP完全問(wèn)題。

• maximal clique problem更多例句

專(zhuān)業(yè)釋義

計(jì)算機(jī)科學(xué)技術(shù)

• 最大集團(tuán)問(wèn)題