Jisho

×
計算複雑性理論
Links
Wikipedia definition
1. Computational complexity theory​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 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 (which basically means that the problem can be stated by a set of mathematical instructions).
Read “Computational complexity theory” on English Wikipedia
Read “計算複雑性理論” on Japanese Wikipedia
Read “Computational complexity theory” on DBpedia

Discussions

to talk about this word.