| time has two-prover interactive protocols. Computational Complexity, 1:3–40, 1991. (2008) | |||||||||||||||
Abstract | |||||||||||||||
| [4] Sanjeev Arora, László Babai, Jacques Stern, and Z Sweedyk. The hardness of approximate optima in lattices, codes, and systems of linear equations. Journal of | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||