Jisho

×
多項式時間
Wikipedia definition
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

Discussions

to talk about this word.

1 Reply ・ Started by StoneLabs at 2025-05-16 13:45:37 UTC ・ Last reply by Leebo at 2025-05-17 05:15:08 UTC