计算复杂性理论的英文

• computational complexity theory

• "计算"英文翻译    count; compute; calculate; r ...
• "复杂性"英文翻译    complexity
• "理论"英文翻译    theory
• "计算复杂性" 英文翻译 :    complexity of computation; complexity of computing; computational complexity theory; computing complexity
• "计算的复杂性理论" 英文翻译 :    theory of complexity of computations
• "复杂性理论" 英文翻译 :    komplexitaetstheorie complexity theory
• "计算复杂性函数" 英文翻译 :    computational complexity function
• "折算复杂性" 英文翻译 :    amortized computation complexity
• "可计算性与计算复杂性" 英文翻译 :    computability and complexity of computing
• "计算复杂度理论" 英文翻译 :    computational complexity theory
• "计算复杂度" 英文翻译 :    computational complexity theory
• "计算的复杂性" 英文翻译 :    complexity of computation; complication of calculus
• "复杂性派生理论" 英文翻译 :    derivation theory of complexity
• "可计算性理论" 英文翻译 :    computability theory; recursion theory
• "复杂性" 英文翻译 :    complexity; complicacy; inhomogeneity 问题的复杂性 the complex nature of the problem; 复杂性因子 complexity factor
• "计算复利的" 英文翻译 :    compounded
• "dna复杂性" 英文翻译 :    dna complexity
• "查询复杂性" 英文翻译 :    query complexity
• "程序复杂性" 英文翻译 :    program complexity
• "带复杂性" 英文翻译 :    tape complexity
• "代码复杂性" 英文翻译 :    code complexity
• "低复杂性" 英文翻译 :    lc low complexity
• "地图复杂性" 英文翻译 :    macomplexity; mapcomplexity
• "电路复杂性" 英文翻译 :    circuit complexity
• "分布复杂性" 英文翻译 :    distributed complexity

• The complexity theory of calculation has proved that the so - called problem of np and other similar problems are equal in calculating
  计算复杂性理论表明，被称作np完全问题的旅行推销员问题以及其它类似的组合优化问题在计算上是等价的。
• Abstract 1 - inkdot alternating pushdown automaton is a slightly modified alternating pushdown automaton with the additional power of marking at most 1 tape - cell on the input with an inkdot once
  计算复杂性理论的一个重要概念是复杂性语言族complexity class ，它包括在给定的资源时间或空间下能够被识别的所有语言。
• The travelling salesman problem ( tsp ) is always one of the most interesting topic in combinatorial majorizationo in the middle seventies , the appearance of the complexity theory of calculation and the development of mathematical programming have greatly improved the advancement of combinatorial majorization
  Tsp问题一直是组合优化中极富活力的研究课题之一。七十年代中期，计算复杂性理论的出现和数学规划的发展大大推动了组合优化的前进。

• 计算复杂性理论的法语：Théorie de la complexité (informatique théorique)
• 计算复杂性理论的日语：計算複雑性理論
• 计算复杂性理论的俄语：Теория сложности вычислений
• 计算复杂性理论的阿拉伯语：تصنيف:نظرية التعقيد الحسابي;
• 计算复杂性理论的印尼文：teori kekompleksan pengiraan; teori kerumitan pengkomputan;