On the complexity of data disjunctions
Theoretical Computer Science - Complexity and logic
Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Complexity of probabilistic planning under average rewards
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Symbolic OBDD-Based Reachability Analysis Needs Exponential Space
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
The complexity of bounded synthesis for timed control with partial observability
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |