| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider 0002, Michael Thomas, Felix Weiss |
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Martin Mundhenk, Felix Weiss |
Intuitionistic implication makes model checking hard |
Logical Methods in Computer Science |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Judy Goldsmith, Christopher Lusena, Martin Mundhenk |
Nonapproximability Results for Partially Observable Markov Decision Processes |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Arne Meier, Martin Mundhenk, Thomas Schneider 0002, Michael Thomas, Heribert Vollmer |
Model Checking CTL is Almost Always Inherently Sequential |
Logical Methods in Computer Science |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Bauland, Martin Mundhenk, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer |
The tractability of model checking for LTL: The good, the bad, and the ugly fragments. |
ACM Trans. Comput. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Mundhenk, Robert Zeranski |
How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms. |
SAT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Mundhenk, Felix Weiß |
The model checking problem for propositional intuitionistic logic with one variable is AC^1-complete. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Mundhenk, Thomas Schneider 0002, Thomas Schwentick, Volker Weber |
Complexity of hybrid logics over transitive frames. |
J. Applied Logic |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Meier, Martin Mundhenk, Thomas Schneider 0002, Michael Thomas, Volker Weber, Felix Weiss |
The complexity of satisfiability for fragments of hybrid logic - Part I. |
J. Applied Logic |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Mundhenk, Felix Weiss |
The Model Checking Problem for Propositional Intuitionistic Logic with One Variable is AC1-Complete |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Martin Mundhenk, Felix Weiß |
The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions. |
RP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk |
The Complexity of Satisfiability for Fragments of CTL and CTL*. |
Int. J. Found. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Bauland, Martin Mundhenk, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer |
The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments. |
Electr. Notes Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Mundhenk, Thomas Schneider 0002 |
The Complexity of Hybrid Logics over Equivalence Relations. |
Journal of Logic, Language and Information |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Meier, Martin Mundhenk, Thomas Schneider 0002, Michael Thomas, Volker Weber, Felix Weiss |
The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider 0002 |
Model Checking CTL is Almost Always Inherently Sequential. |
TIME |
2009 |
DBLP DOI BibTeX RDF |
Model checking, complexity, temporal logic |
| 1 | Arne Meier, Martin Mundhenk, Thomas Schneider 0002, Michael Thomas, Volker Weber, Felix Weiss |
The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
Post’s lattice, complexity, satisfiability, decidability, hybrid logic |
| 1 | Matthias Hagen, Peter Horatschek, Martin Mundhenk |
Experimental comparison of the two Fredman-Khachiyan-algorithms. |
ALENEX |
2009 |
DBLP BibTeX RDF |
|
| 1 | Michael Bauland, Martin Mundhenk, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer |
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Judy Goldsmith, Matthias Hagen, Martin Mundhenk |
Complexity of DNF minimization and isomorphism testing for monotone formulas. |
Inf. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Meier, Martin Mundhenk, Michael Thomas, Heribert Vollmer |
The Complexity of Satisfiability for Fragments of CTL and CTL*. |
Electr. Notes Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Mundhenk, Thomas Schneider 0002, Thomas Schwentick, Volker Weber |
Complexity of Hybrid Logics over Transitive Frames |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Michael Bauland, Martin Mundhenk, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer |
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Martin Mundhenk, Thomas Schneider 0002 |
Undecidability of Multi-modal Hybrid Logics. |
Electr. Notes Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Judy Goldsmith, Martin Mundhenk |
Competition Adds Complexity. |
NIPS |
2007 |
DBLP BibTeX RDF |
|
| 1 | Christoph Meinel, Martin Mundhenk |
Mathematische Grundlagen der Informatik - Mathematisches Denken und Beweisen: eine Einführung, 3. Auflage. |
|
2006 |
RDF |
|
| 1 | Clemens Beckstein, Peter Dittrich, Christian Erfurth, Dietmar Fey, Birgitta König-Ries, Martin Mundhenk, Harald Sack |
SOGOS - A Distributed Meta Level Architecture for the Self-Organizing Grid of Services. |
MDM |
2006 |
DBLP DOI BibTeX RDF |
Meta Level Architecture, Trust, Mobile Agents, Planning, Self-Organization, System Dynamics, Semantic Services, Adaptive Grid |
| 1 | Judy Goldsmith, Matthias Hagen, Martin Mundhenk |
Complexity of DNF and Isomorphism of Monotone Formulas. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Meinel, Martin Mundhenk |
Mathematische Grundlagen der Informatik - Mathematisches Denken und Beweisen, Eine Einführung, 2. Auflage |
|
2002 |
RDF |
|
| 1 | Christopher Lusena, Judy Goldsmith, Martin Mundhenk |
Nonapproximability Results for Partially Observable Markov Decision Processes. |
J. Artif. Intell. Res. (JAIR) |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerd Hoff, Martin Mundhenk |
Creating a virtual library with HPSearch and Mops. |
IuK |
2001 |
DBLP BibTeX RDF |
|
| 1 | Gerd Hoff, Martin Mundhenk |
Finding scientific papers with homepagesearch and MOPS. |
SIGDOC |
2001 |
DBLP DOI BibTeX RDF |
focused navigation, intelligent search techniques, scientific literature on the web |
| 1 | Christopher Lusena, Judy Goldsmith, Martin Mundhenk |
Nonapproximability Results for Partially Observable Markov Decision Processes |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
2000 |
RDF |
|
| 1 | Martin Mundhenk |
On hard instances. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Mundhenk, Judy Goldsmith, Christopher Lusena, Eric Allender |
Complexity of finite-horizon Markov decision process problems. |
J. ACM |
2000 |
DBLP DOI BibTeX RDF |
NPPP, computational complexity, Markov decision processes, NP, PL, partially observable Markov decision processes, PSPACE, succinct representations |
| 1 | Martin Mundhenk |
The Complexity of Optimal Small Policies. |
Math. Oper. Res. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Meinel, Martin Mundhenk |
Mathematische Grundlagen der Informatik - Mathematisches Denken und Beweisen, Eine Einführung |
|
2000 |
RDF |
|
| 1 | Vikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán |
Nondeterministic Instance Complexity and Hard-to-Prove Tautologies. |
STACS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Mundhenk, Judy Goldsmith, Christopher Lusena, Eric Allender |
Complexity of Finite-Horizon Markov Decision process Problems. |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1999 |
RDF |
|
| 1 | Martin Mundhenk |
The complexity of optimal small policies |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1999 |
RDF |
|
| 1 | Martin Mundhenk |
Propositional Proofs and Their Complexity |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1999 |
RDF |
|
| 1 | Gerd Hoff, Martin Mundhenk |
Finding Scientific Papers with HPSearch and MOPS |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1999 |
RDF |
|
| 1 | Michael L. Littman, Judy Goldsmith, Martin Mundhenk |
The Computational Complexity of Probabilistic Planning |
CoRR |
1998 |
DBLP BibTeX RDF |
|
| 1 | Michael L. Littman, Judy Goldsmith, Martin Mundhenk |
The Computational Complexity of Probabilistic Planning. |
J. Artif. Intell. Res. (JAIR) |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Judy Goldsmith, Martin Mundhenk |
Complexity Issues in Markov Decision Processes. (PDF / PS) |
IEEE Conference on Computational Complexity |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Mundhenk |
NP-Hard Sets Have Many Hard Instances. |
MFCS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Mundhenk, Judy Goldsmith, Eric Allender |
The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision Processes. |
MFCS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Mundhenk, Anna Slobodová |
Optimal Non-approximability of MAXCLIQUE. |
Lectures on Proof Verification and Approximation Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Meinel, Carsten Damm, Martin Mundhenk |
33. Workshop "Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen". |
GI Jahrestagung |
1997 |
DBLP BibTeX RDF |
|
| 1 | Judy Goldsmith, Michael L. Littman, Martin Mundhenk |
The Complexity of Plan Existence and Evaluation in Probabilistic Domains. |
UAI |
1997 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Johannes Köbler, Martin Mundhenk |
Monotonous and Randomized Reductions to Sparse Sets. |
ITA |
1996 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Johannes Köbler, Martin Mundhenk |
Upper Bounds for the Complexity of Sparse and Tally Descriptions. |
Mathematical Systems Theory |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Judy Goldsmith, Matthew A. Levy, Martin Mundhenk |
Limited nondeterminism. |
SIGACT News |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Mundhenk |
Monotonous Oracle Machines |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1995 |
RDF |
|
| 1 | Vikraman Arvind, Johannes Köbler, Martin Mundhenk |
On Reductions to Sets that Avoid EXPSPACE. |
Inf. Process. Lett. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Mundhenk |
On Monotonous Oracle Machines. |
LATIN |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Mundhenk |
On Self-Reducible Sets of Low Information Content. |
CIAC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Mundhenk |
Hausdorff-Reduktionen zu Mengen mit geringem Informationsgehalt. |
|
1993 |
RDF |
|
| 1 | Vikraman Arvind, Johannes Köbler, Martin Mundhenk |
Hausdorff Reductions to Sparse Sets and to Sets of High Information Content. |
MFCS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf |
Reductions to Sets of Low Information Content. |
ICALP |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf |
Reductions to Sets of Low Information Content. |
Complexity Theory: Current Research |
1992 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Johannes Köbler, Martin Mundhenk |
Lowness and the Complexity of Sparse and Tally Descriptions. |
ISAAC |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Johannes Köbler, Martin Mundhenk |
On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets. |
FSTTCS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Mundhenk, Rainer Schuler |
Random languages for nonuniform complexity classes. |
J. Complexity |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Mundhenk, Rainer Schuler |
Non-Uniform Complexity Classes and Random Languages. |
Structure in Complexity Theory Conference |
1990 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")