On the interactive complexity of graph reliability - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 1994

On the interactive complexity of graph reliability

Résumé

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, the standard PSPACE-complete language. Another interesting aspect of our protocol is that it includes a general method to deal with rational numbers in interactive proof systems.
Fichier principal
Vignette du fichier
ark _67375_HCB-9HP2CMJ6-0.pdf (770.2 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04526104 , version 1 (03-04-2024)

Identifiants

Citer

Jean-Marc Couveignes, Juan Francisco Diaz-Frias, Michel de Rougemont, Miklos Santha. On the interactive complexity of graph reliability. International Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 1994, Madras, India. pp.12-23, ⟨10.1007/3-540-58715-2_110⟩. ⟨hal-04526104⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More