Using Approximation Hardness to Achieve Dependable Computation

Mike Burmester, Yvo Desmedt, Yongge Wang. Using Approximation Hardness to Achieve Dependable Computation. In Michael Luby, José D. P. Rolim, Maria J. Serna, editors, Randomization and Approximation Techniques in Computer Science, Second International Workshop, RANDOM 98, Barcelona, Spain, October 8-10, 1998, Proceedings. Volume 1518 of Lecture Notes in Computer Science, pages 172-186, Springer, 1998. [doi]

Abstract

Abstract is missing.