计算复杂度的英文

• computational complexity theory

• "计算"英文翻译    count; compute; calculate; r ...
• "复杂"英文翻译    complex; complicated
• "度"英文翻译    surmise; estimate
• "计算复杂度理论" 英文翻译 :    computational complexity theory
• "计算复杂性" 英文翻译 :    complexity of computation; complexity of computing; computational complexity theory; computing complexity
• "计算复杂性函数" 英文翻译 :    computational complexity function
• "计算复杂性理论" 英文翻译 :    computational complexity theory
• "复杂度" 英文翻译 :    complex rate; order of complexity; space complexity
• "可计算性与计算复杂性" 英文翻译 :    computability and complexity of computing
• "折算复杂性" 英文翻译 :    amortized computation complexity
• "带复杂度" 英文翻译 :    tape complexity
• "复杂度类" 英文翻译 :    complexity class
• "复杂度理论" 英文翻译 :    computational complexity theory
• "复杂度系数" 英文翻译 :    complexity factor
• "化学复杂度" 英文翻译 :    chemical complexity
• "空间复杂度" 英文翻译 :    computational complexity theory; space complexity
• "圈复杂度" 英文翻译 :    cyclomatic complexity
• "时间复杂度" 英文翻译 :    computational complexity theory; time complexity
• "循环复杂度" 英文翻译 :    cyclomatic complexity
• "询问复杂度" 英文翻译 :    query complexity degree
• "计算复利的" 英文翻译 :    compounded
• "等效门复杂度" 英文翻译 :    equivalent gate complexity
• "多项式类别（复杂度）" 英文翻译 :    class
• "时间复杂度性函数" 英文翻译 :    time complexity function
• "时间空间复杂度" 英文翻译 :    time space complexity

• Furthermore , the computational complexity with the proposed method is greatly reduced
  并且，该方法具有较低的计算复杂度。
• Draft itu - t recommendation and final draft international standard of joint video specification
  同时， c2dvlc具有低计算复杂度低实现复杂度的特点。
• Each prediction mode needs to be checked to each 4 4 block , so it has great complexity
  在判断其预测模式中要求4 4块的每种预测模式都要判断，因此计算复杂度很高。
• The computing complexity and computing time of this algorithm is lower than that of existed algorithms
  该算法比已有的块三对角矩阵求逆算法的计算复杂度和计算时间低。
• The delay is short , the algorithmic complexity is not high and g . 729a is suitably implemented on dsp chip
  并且时延较短，计算复杂度也不大，适合使用dsp芯片来实现。
• Journal of computer science and technology , 2001 , 16 : 489 - 504 . 9 zhao m . data description based on reduct theory
  其二，在计算复杂度上，这个方法计算正区域reduct等是o m2
• Packing problems are categorized as discrete combinatorial optimization problems with np - complete computational complexities
  布局问题是具有np完备计算复杂度的离散组合优化问题。
• The proposed method can improve location accuracy without increasing communication traffic and computing complexity
  该算法在不增加原算法通信量及计算复杂度的基础上提高了定位精度。
• The time complexity will be different according to the number and value of input properties , such as cobweb algorithm
  如cob场王b ，计算复杂度会因输入属性的数目和属性值的不同而剧烈变化。
• In this paper , a new dynamic programming algorithm for unconstrained 2d stock cutting problem is presented
  摘要本文给出了一种求解无限制板材下料问题的动态规划解法，对该算法的计算复杂度进行了分析。