- ホーム
- > 洋書
- > 英文書
- > Science / Mathematics
Full Description
Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of steps required for the algorithm to solve a problem is bounded by some polynomial in the length of the input.



