Dynamic problem (algorithms)
（重定向自Dynamic algorithm）
Dynamic problems in computational complexity theory are problems stated in terms of the changing input data. In the most general form a problem in this category is usually stated as follows:
Problems of this class have the following measures of complexity: