Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Combinatorial optimization with rational objective functions
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Approximate solutions to problems in PSPACE
ACM SIGACT News
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Strong bounds on the approximability of two Pspace-hard problems in propositional planning
Annals of Mathematics and Artificial Intelligence
Towards a Predictive Computational Complexity Theory
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Design and Results of the Tableaux-99 Non-classical (Modal) Systems Comparison
TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Complexity results about Nash equilibria
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Solving H-horizon, stationary Markov decision problems in time proportional to log(H)
Operations Research Letters
| Hi-index | 0.00 |
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.