The set of all such problems is the complexity class SUBEXP which can be defined in terms of DTIME as follows.
所有這些問題的集合是複雜性SUBEXP，可以按照 DTIME 的方式定義如下。