polynomial time
短语释义与例句
n.
-
1.
The complexity class where the runtime can be bounded (from above) by a polynomial in the input size.
不可数 数学
The complexity class where the runtime can be bounded (from above) by a polynomial in the input size.