Off-campus UMass Amherst users: To download dissertations, please use the following link to log into our proxy server with your UMass Amherst user name and password.

Non-UMass Amherst users, please click the view more button below to purchase a copy of this dissertation from Proquest.

(Some titles may also be available free of charge in our Open Access Dissertation Collection, so please check there first.)

Dynamic computational complexity

William M Hesse, University of Massachusetts Amherst


Dynamic computational complexity is the study of resource-bounded ongoing computational processes. We consider the general problem of processing a sequence of inputs, instead of a single input. We introduce a new model for dynamic computation, and investigate the computational complexity of various dynamic problems. The field of computational complexity has previously studied static computation, which takes a single fixed input and computes the desired result. We define a dynamic problem to be the function mapping a stream of data to the desired stream of output, and we investigate the complexity of the dynamic computation required to compute that function. We describe complexity classes of dynamic problems, reductions between dynamic problems, and complete problems for dynamic complexity classes.

Subject Area

Computer science

Recommended Citation

Hesse, William M, "Dynamic computational complexity" (2003). Doctoral Dissertations Available from Proquest. AAI3110502.