论文信息 - The complexity of dynamic languages and dynamic optimization problems

The complexity of dynamic languages and dynamic optimization problems

In this paper we offer a unifying framework for dynamic problems in terms of “dynamic languages”, and we discuss the complexity of these languages. In particular, many dynamic languages derived from NP-complete languages can be shown to be polynomial space (P-space) complete. Among these are the following: the dynamic 3-satisfiability problem, and dynamic 3-dimensional matching problem, the dynamic partition problem, the dynamic hamiltonian circuit problem, and the dynamic independent set problem. We provide a general technique for showing how to prove the P-space completeness of dynamic problems derived from NP-complete problems.

James B. Orlin | J. Orlin

[1] G. Dantzig,et al. FINDING A CYCLE IN A GRAPH WITH MINIMUM COST TO TIME RATIO WITH APPLICATION TO A SHIP ROUTING PROBLEM , 1966 .

[2] R. W. Simpson,et al. Scheduling and routing models for airline systems , 1969 .

[3] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

[4] Chung Laung Liu,et al. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[5] Kenneth R. Baker,et al. Workforce Allocation in Cyclical Scheduling Problems: A Survey , 1976 .

[6] Sudarshan K. Dhall,et al. On a Real-Time Scheduling Problem , 1978, Oper. Res..

[7] Thomas J. Schaefer,et al. On the Complexity of Some Two-Person Perfect-Information Games , 1978, J. Comput. Syst. Sci..

[8] Nimrod Megiddo,et al. Combinatorial optimization with rational objective functions , 1978, Math. Oper. Res..

[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10] James B. Orlin,et al. The Infinite-Horizon Dynamic Lot-Size Problem with Cyclic Demand and Costs , 1980 .

[11] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .

[12] Charles U. Martel,et al. Scheduling Periodically Occurring Tasks on Multiple Processors , 1981, Inf. Process. Lett..

[13] James B. Orlin,et al. Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets , 1982, Oper. Res..