Polynomial Time Algorithm 631 浏览 0关注

In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the length of the String (computer science)|string representing the input. The time complexity of an algorithm is commonly expressed using big O notation, which excludes coefficients 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. For example, if the time required by an algorithm on all inputs of size n is at most , the asymptotic time complexity is O(n3). Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, where an elementary operation takes a fixed amount of time to perform. Thus the amount of time taken and the number of elementary operations performed by the algorithm differ by at most a constant factor. Big O notation is used in computer algorithms as a worst-case scenario illustration....
 相关概念
 主要的会议/期刊 CORR SODA STOC ALGORIT... FOCS ISAAC ICALP TCS