Dr. rer. nat. Martin Mundhenk
Informatikwissenschaften, Universität Trier
- 0651/201-2838
- 0651/201-3954
Mundhenk, M.; Meinel, C.
Mathematische Grundlagen der InformatikStuttgart, Leipzig: B.G.Teubner 2000
Arvind, Vikraman; Köbler, Johannes; Mundhenk, Martin et al.
Nondeterministic Instance Complexity and Hard-to-Prove TautologiesLecture notes in computer science. Bd. 1770. Berlin: Springer 2000 S. 314 - 323
Mundhenk, M.
On hard instancesTheoretical Computer Science. Bd. Theoretical Computer Science. Elsevier 2000 S. 301 - 311
Mundhenk, M.
Complexity of propositional proof systems: tableaux, resolution, cutting-planes11th European Summerschool on Logic, Language, and Information. 1999
Mundhenk, M.; Margenstern, M.; Singer, D.
Hard instances of NP-hard setsMargenstern, M.; Singer, D. (Hrsg). Proceedings of JIM´99. Metz. 1999 S. 120 - 131
Mundhenk, Martin
The complexity of optimal small policiesTrier: Univ., Mathematik/Informatik 1999 15 S. (Trierer Forschungsberichte ; Nr. 99-22)
Goldsmith, J.; Mundhenk, M.
Complexity issues in Markov decision processesProceedings of the 13th Conference on Computational Complexity. IEEE Press 1998 S. 272 - 280
Mundhenk, M.; Slobodová, A.; Mayr, E. W. et al.
Optimal non-approximability of Max-Clique - a surveyMayr, E. W.; Prömel, H.-J.; Steger, A. (Hrsg). Lectures on proof verification and approximation algorithms. Springer 1998 S. 235 - 248
Littman, Michael L.; Goldsmith, Judy; Mundhenk, Martin
The Computational Complexity of Probabilistic PlanningThe journal of artificial intelligence research. JAIR. Bd. 9. San Francisco, Calif.: Morgan Kaufmann Publ. 1998 S. 1 - 36
Mundhenk, M.
NP-hard Sets Have Many Hard InstancesLecture notes in computer science. Bd. 1295. Berlin: Springer 1997 S. 428 - 437
Goldsmith, J.; Littman, M.; Mundhenk, M.
The complexity of plan existence and evaluation in probabilistic domainsProc. 13th Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann Publishers 1997 S. 182 - 189
Mundhenk, M.; Goldsmith, J.; Allender, E.
The Complexity of Policy Evaluation for Finite-Horizon Partially- Observable Markov Decision ProcessesLecture notes in computer science. Bd. 1295. Berlin: Springer 1997 S. 129 - 138