Computer Science – Computational Complexity
Scientist
Computer Science
Computational Complexity
Scientist
University of Jena
Univ. Jena, Germany
Friedrich-Schiller-Universität Jena
Complexity of Hybrid Logics over Transitive Frames
Intuitionistic implication makes model checking hard
Model Checking CTL is Almost Always Inherently Sequential
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers
The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I
No associations
LandOfFree
Martin Mundhenk does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Martin Mundhenk, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Martin Mundhenk will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-179630