Computational Complexity
801
浏览
0
关注

Computational complexity theory is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those Complexity class|classes to each other. In this context, a computational problem is understood to be a task that is in principle amenable to being solved by a computer (i.e. the problem can be stated by a set of mathematical instructions). Informally, a computational problem consists of problem instances and solutions to these problem instances. For example, primality testing is the problem of determining whether a given number is prime number|prime or not. The instances of this problem are natural numbers, and the solution to an instance is yes or no based on whether the number is prime or not. A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used. The theory formalizes this intuition, by...
[展开]
相关概念
Lower Bound    
Real Time    
Video Coding    
Upper Bound    
主要的会议/期刊
演化趋势
Chart will load here
Computational Complexity文章数量变化趋势

Feedback
Feedback
Feedback
我想反馈:
排行榜