Go backward to Asymptotic ClassesGo up to TopGo forward to Summary |

Largest problem that can be solved in fixed time.

Execution Steps 1 second 1 minute 1 hour log _{2}(n)2 ^{106}2 ^{6*107}2 ^{36*108}n10 ^{6}6*10 ^{7}3.6*10 ^{9}nlog_{2}(n)62746 2.8*10 ^{6}1.3*10 ^{8}n^{2}1000 7746 60000 2 ^{n}23 26 32 n!9 11 12

*Problems that can be solved only by exponential time algorithms are
intractable*.

Author: Wolfgang Schreiner

Last Modification: December 14, 1999