Authors: LITTMAN ML GOLDSMITH J MUNDHENK M

Citation: Ml. Littman et al., THE COMPUTATIONAL-COMPLEXITY OF PROBABILISTIC PLANNING, The journal of artificial intelligence research, 9, 1998, pp. 1-36

Authors: ARVIND V KOBLER J MUNDHENK M

Citation: V. Arvind et al., MONOTONOUS AND RANDOMIZED REDUCTIONS TO SPARSE SETS, Informatique theorique et applications, 30(2), 1996, pp. 155-179

Authors: ARVIND V KOBLER J MUNDHENK M

Citation: V. Arvind et al., UPPER-BOUNDS FOR THE COMPLEXITY OF SPARSE AND TALLY DESCRIPTIONS, Mathematical systems theory, 29(1), 1996, pp. 63-94

Authors: ARVIND V KOBLER J MUNDHENK M

Citation: V. Arvind et al., ON REDUCTIONS TO SETS THAT AVOID EXPSPACE, Information processing letters, 56(2), 1995, pp. 109-114