Complexity of finite-horizon Markov decision process problems
Journal of the ACM (JACM)
SIGACT news complexity theory column 38
ACM SIGACT News
The complexity of approximating pspace-complete problems for hierarchical specifications
Nordic Journal of Computing
The Complexity of Some Basic Problems for Dynamic Process Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
On Reachability in Graphs with Bounded Independence Number
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
The Expressive Power and Complexity of Dynamic Process Graphs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Fundamenta Informaticae - Special issue on computing patterns in strings
Traversals of object structures: Specification and Efficient Implementation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Complexity, appeal and challenges of combinatorial games
Theoretical Computer Science - Algorithmic combinatorial game theory
Trading uninitialized space for time
Information Processing Letters
Functions computable in polynomial space
Information and Computation
Linear connectivity problems in directed hypergraphs
Theoretical Computer Science
Towards a Study of Low-Complexity Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Generalizing Boolean satisfiability I: background and survey of existing work
Journal of Artificial Intelligence Research
Complexity of probabilistic planning under average rewards
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Theoretical Computer Science
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
Functions computable in polynomial space
Information and Computation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Exponential space complexity for symbolic maximum flow algorithms in 0-1 networks
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
The multivariate resultant is NP-hard in any characteristic
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
On symbolic OBDD-based algorithms for the minimum spanning tree problem
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Holographic computation of balanced succinct permanent instances
OSC'10 Proceedings of the Third international conference on Optical supercomputing
Succinct algebraic branching programs characterizing non-uniform complexity classes
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Model-checking hierarchical structures
Journal of Computer and System Sciences
The complexity of problems on implicitly represented inputs
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Complexity bounds for the verification of real-time software
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Complexity of linear connectivity problems in directed hypergraphs
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Finding shortest witnesses to the nonemptiness of automata on infinite words
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
The complexity of discretionary access control
IWSEC'06 Proceedings of the 1st international conference on Security
On symbolic OBDD-based algorithms for the minimum spanning tree problem
Theoretical Computer Science
Efficiency-revenue trade-offs in auctions
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Fundamenta Informaticae - Computing Patterns in Strings
Algorithms and limits for compact plan representations
Journal of Artificial Intelligence Research
On the complexity of the multivariate resultant
Journal of Complexity
| Hi-index | 0.00 |