Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Henk, Martin"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Expected Frobenius numbers
Iskander Aliev
,
Martin Henk
,
Aicke Hinrichs
Journal of Combinatorial Theory Series A
118
(2), 2011, pp. 525-531
The model checking problem for propositional intuitionistic logic with one variable is AC
^1
-complete
Martin Mundhenk
,
Felix Weiß
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 368-379
The complexity of satisfiability for fragments of hybrid logic - Part I
Arne Meier
,
Martin Mundhenk
,
Thomas Schneider
,
Michael Thomas
,
Volker Weber
,
Felix Weiss
Lecture Notes in Computer Science
5734
, 2009, pp. 587-599
The complexity of satisfiability for fragments of CTL and CTL*
Arne Meier
,
Michael Thomas
,
Heribert Vollmer
,
Martin Mundhenk
International Journal of Foundations of Computer Science
20
(5), 2009, pp. 901-918
Complexity of DNF minimization and isomorphism testing for monotone formulas
Judy Goldsmith
,
Matthias Hagen
,
Martin Mundhenk
Information and Computation
206
(6), 2008, pp. 760-775
Complexity of DNF and isomorphism of monotone formulas
Judy Goldsmith
,
Matthias Hagen
,
Martin Mundhenk
Lecture Notes in Computer Science
3618
, 2005, pp. 410-421
Diophantine approximations and integer points of cones
Martin Henk
,
Robert Weismantel
Combinatorica
22
(3), 2002, pp. 401-407
Nondeterministic instance complexity and hard-to-prove tautologies
Vikraman Arvind
,
Johannes Köbler
,
Martin Mundhenk
,
Jacobo Torán
Lecture Notes in Computer Science
1770
, 2000, pp. 314-323
Complexity of finite-horizon Markov decision process problems
Martin Mundhenk
,
Judy Goldsmith
,
Christopher Lusena
,
Eric Allender
Journal of the ACM
47
(4), 2000, pp. 681-720
On hard instances
Martin Mundhenk
Theoretical Computer Science
242
(1-2), 2000, pp. 301-311
Randomized simplex algorithms on Klee-Minty cubes
Bernd Gärtner
,
Martin Henk
,
Günter M. Ziegler
Combinatorica
18
(3), 1998, pp. 349-372
Complexity issues in Markov decision processes
Judy Goldsmith
,
Martin Mundhenk
Proceedings of the 13th Annual IEEE Conference on Computational Complexity (Buffalo, New York, June 15-18, 1998)
, 1998, pp. 272-280
Optimal non-approximability of MaxClique
Martin Mundhenk
,
Anna Slobodová
Lecture Notes in Computer Science
1367
, 1998, pp. 235-248
Basic properties of convex polytopes
Martin Henk
,
Jürgen Richter-Gebert
,
Günter M. Ziegler
Handbook of Discrete and Computational Geometry, 1997, pp. 243-270
Test sets of the knapsack problem and simultaneous diophantine approximation
Martin Henk
,
Robert Weismantel
Lecture Notes in Computer Science
1284
, 1997, pp. 271-283
Note on shortest and nearest lattice vectors
Martin Henk
Information Processing Letters
61
(4), 1997, pp. 183-188
The complexity of policy evaluation for finite-horizon partially-observable Markov decision processes
Martin Mundhenk
,
Judy Goldsmith
,
Eric Allender
Lecture Notes in Computer Science
1295
, 1997, pp. 129-138
NP
-hard sets have many hard instances
Martin Mundhenk
Lecture Notes in Computer Science
1295
, 1997, pp. 428-437
On Hilbert bases of polyhedral cones
Martin Henk
,
Robert Weismantel
Technical Report (SC96-12), 1996, April
On self-reducible sets of low information content
Martin Mundhenk
Lecture Notes in Computer Science
778
, 1994, pp. 203-212
Random languages for nonuniform complexity classes
Martin Mundhenk
,
Rainer Schuler
Journal of Complexity
7
, 1991, pp. 296-310
Random languages for non-uniform complexity classes
Martin Mundhenk
,
Rainer Schuler
Technical Report (2/89), 1989