Author:
Lipton Richard J.,Regan Kenneth W.,Rudra Atri
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and hardness of approximation problems. J. Assn. Comp. Mach. 45, 501–555 (1998)
2. Arora, S., Safra, S.: Probabilistic checking of proofs: a new characterization of NP. J. Assn. Comp. Mach. 45, 70–122 (1998)
3. Arora, S., Sudan, M.: Improved low-degree testing and its applications. Combinatorica 23(3), 365–426 (2003)
4. Assumus Jr., E.F., Key, J.D.: Polynomial codes and Finite Geometries in Handbook of Coding Theory. In: Pless Jr., V.S., Huffman, W.C. (eds.), vol. II, ch.16. Elsevier, Amsterdam (1998)
5. Baur, W., Strassen, V.: The complexity of partial derivatives. Theor. Comp. Sci. 22, 317–330 (1982)