FSTTCS
1994
Springer
13 years 8 months ago
1994
Springer
We give an interactive protocol for s-t RELIABILITY, the well known reliability problem on graphs. Our protocol shows that if IP(f(n)) denotes the class of languages whose interac...
FSTTCS
1994
Springer
13 years 8 months ago
1994
Springer
Abstract. This paper surveys work on the synthesis of reactive programs which implement winning strategies in infinite two-person games. The representation of such games by Muller ...
FSTTCS
1994
Springer
13 years 8 months ago
1994
Springer
FSTTCS
1994
Springer
13 years 8 months ago
1994
Springer
We review the past ten years in computational complexity theory by focusing on ten theorems that the author enjoyed the most. We use each of the theorems as a springboard to discus...