多項式時間
1. Time complexityIn computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O notation, which suppresses multiplicative constants and lower order terms. When expressed this way, the time complexity is said to be described asymptotically, i.e. , as the input size goes to infinity.
Read “Time complexity” on English Wikipedia
Read “多項式時間” on Japanese Wikipedia
Read “Time complexity” on DBpedia
Read “Time complexity” on English Wikipedia
Read “多項式時間” on Japanese Wikipedia
Read “Time complexity” on DBpedia
Discussions
Log in to talk about this word.
Incorrect entry