On the Interactive Complexity of Graph Reliability

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 interactive complexity is O(f(n)), that is the set of languages which can be accepted by an interactive proof system with O(f(n)) number of rounds, then s - t RELIABILITY IP(n). This complexity is significantly smaller than what one could get via reduction to QBF, tha standard PSPACE-complete language. In oerther to establish the protocol, we design a general method Another interesting aspect of our protocol is that we have to deal with rational numbers due to the probabilistic aspect of the problem.

• Type: Conference
• Year: 1994
• Where: FSTTCS
• Authors: Jean Marc Couveignes, Juan Francisco Diaz-Frias, Michel de Rougemont, Miklos Santha
• Keywords: FSTTCS 1994, Interactive Protocol, Reliability Problem, S-t Reliability, Software Engineering