It is proved that the SEE' satisfiability is solvable in the polynomial time by means of giving a concrete deterministic Turing Machine.

  • 通过给出具体的确定型图林机,证明了SBE的可满足性(SAT)问题在多项式时间内可解。

  • 互联网摘选 2025-01-20 17:26:52

    • 重点词汇
    • 相关例句
    精确
    • 模糊
    • 词首
    • 词尾
    • 词义
    • 例句