计算复杂性理论 meaning in Chinese

computational complexity theory

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问题一直是组合优化中极富活力的研究课题之一。七十年代中期，计算复杂性理论的出现和数学规划的发展大大推动了组合优化的前进。