Martin Mundhenk

Available identifiers

zbMath Open mundhenk.martinMaRDI QIDQ475338

List of research outcomes

Publication	Date of Publication	Type
On monotonous oracle machines	2022-08-16	Paper
Reductions to sets of low information content	2019-12-04	Paper
Experimental comparison of the two Fredman-Khachiyan-algorithms	2019-09-11	Paper
The model checking fingerprints of CTL operators	2019-08-13	Paper
https://portal.mardi4nfdi.de/entity/Q4584892	2018-09-04	Paper
Optimal non-approximability of MaxClique	2018-07-03	Paper
On the complexity of bribery and manipulation in tournaments with uncertain information	2015-12-23	Paper
Complexity of finite-horizon Markov decision process problems	2015-12-17	Paper
Mathematische Grundlagen der Informatik	2015-10-27	Paper
The tractability of model checking for LTL	2015-09-17	Paper
The complexity of primal logic with disjunction	2015-04-02	Paper
The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments	2015-03-23	Paper
An \(\mathsf{AC}^{1}\)-complete model checking problem for intuitionistic logic	2014-11-26	Paper
Undecidability of Multi-modal Hybrid Logics	2013-12-20	Paper
Intuitionistic implication makes model checking hard	2012-05-16	Paper
The model checking problem for propositional intuitionistic logic with one variable is AC 1 -complete	2012-01-23	Paper
How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms	2011-06-17	Paper
https://portal.mardi4nfdi.de/entity/Q2995546	2011-04-26	Paper
Complexity of hybrid logics over transitive frames	2011-03-22	Paper
The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions	2010-08-31	Paper
The complexity of hybrid logics over equivalence relations	2010-01-06	Paper
Complexity of DNF minimization and isomorphism testing for monotone formulas	2008-08-22	Paper
Mathematical Foundations of Computer Science 2005	2006-10-20	Paper
https://portal.mardi4nfdi.de/entity/Q5479656	2006-07-11	Paper
https://portal.mardi4nfdi.de/entity/Q4673623	2005-05-06	Paper
The Complexity of Optimal Small Policies	2001-11-26	Paper
https://portal.mardi4nfdi.de/entity/Q2717785	2001-06-18	Paper
https://portal.mardi4nfdi.de/entity/Q4699290	2000-11-08	Paper
https://portal.mardi4nfdi.de/entity/Q4501542	2000-09-04	Paper
On hard instances	2000-08-21	Paper
https://portal.mardi4nfdi.de/entity/Q4938158	2000-02-22	Paper
https://portal.mardi4nfdi.de/entity/Q4699319	1999-11-10	Paper
https://portal.mardi4nfdi.de/entity/Q4260374	1999-09-19	Paper
https://portal.mardi4nfdi.de/entity/Q4258591	1999-09-13	Paper
https://portal.mardi4nfdi.de/entity/Q4256649	1999-08-08	Paper
https://portal.mardi4nfdi.de/entity/Q4246757	1999-06-15	Paper
https://portal.mardi4nfdi.de/entity/Q4215779	1998-10-28	Paper
Monotonous and randomized reductions to sparse sets	1997-04-29	Paper
Upper bounds for the complexity of sparse and tally descriptions	1996-02-20	Paper
https://portal.mardi4nfdi.de/entity/Q4281491	1994-03-10	Paper
Random languages for nonuniform complexity classes	1992-06-26	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Martin Mundhenk