Arithmetic circuits: A survey of recent results and open questions

Foundations and Trends in Theoretical Computer Science

Volumn 5, Issue 3-4, 2009, Pages 207-388

  Shpilka, Amir ^a   Yehudayoff, Amir ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC MODELS; ARITHMETIC CIRCUIT; BOOLEAN CIRCUIT; FUNDAMENTAL PROBLEM; GEOMETRIC COMPLEXITY; LARGE CLASS; LOWER BOUNDS; MATHEMATICAL TOOLS; MULTILINEAR CIRCUITS; NEW APPROACHES; POLYNOMIAL IDENTITIES; POLYNOMIAL IDENTITY TESTING; STANDARD MODEL; STRUCTURED MODEL; SYMBOLIC COMPUTATION; THEORETICAL COMPUTER SCIENCE;

INTEGRATING CIRCUITS; POLYNOMIALS; SURVEYS;

LOGIC CIRCUITS;

EID: 78650453766     PISSN: 1551305X     EISSN: 15513068     Source Type: Journal    
DOI: 10.1561/0400000039     Document Type: Article

References (148)

1. S. Aaronson, "Arithmetic natural proofs theory is sought," http:// scottaaronson.com/blog/?p=336, 2008. [
2. M. Agrawal, "Proving lower bounds via pseudo-random generators," in Proceedings of the 25th FSTTCS, vol. 3821 of LNCS, pp. 92-105, 2005.
3. M. Agrawal and S. Biswas, "Primality and identity testing via Chinese remaindering," Journal of the ACM, vol. 50, pp. 429-443, 2003.
4. M. Agrawal, N. Kayal, and N. Saxena, "Primes is in P," Annals of Mathematics, vol. 160, pp. 781-793, 2004.
5. M. Agrawal and V. Vinay, "Arithmetic circuits: A chasm at depth four," in Proceedings of the 49th Annual FOCS, pp. 67-75, 2008.
6. N. Alon, "Combinatorial nullstellensatz," Combinatorics, Probability and Computing, vol. 8, pp. 7-29, 1999.
7. S. A. Amitsur and J. Levitzki, "Minimal identities for algebras," Proceedings of the American Mathematical Society, vol. 1, pp. 449-463, 1950.
8. M. Anderson, D. van Melkebeek, and I. Volkovich, "Derandomizing polynomial identity testing for multilinear constant-read formulae," Electronic Colloquium on Computational Complexity (ECCC), vol. 135, 2010. http:// www.eccc.uni-trier.de/report/2010/189/.
9. S. Arora and B. Barak, Computational Complexity: A Modern Approach. Cambridge University Press, 2009.
10. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, "Proof verification and the hardness of approximation problems," Journal of the ACM, vol. 45, pp. 501-555, 1998.
11. S. Arora and S. Safra, "Probabilistic checking of proofs: A new characterization of NP," Journal of the ACM, vol. 45, pp. 70-122, 1998.
12. V. Arvind and P. Mukhopadhyay, "The monomial ideal membership problem and polynomial identity testing," in Proceedings of the 18th ISAAC, pp. 800-811, 2007.
13. V. Arvind and P. Mukhopadhyay, "Derandomizing the isolation lemma and lower bounds for circuit size," in APPROX-RANDOM, pp. 276-289, 2008.
14. V. Arvind, P. Mukhopadhyay, and S. Srinivasan, "New results on noncommutative and commutative polynomial identity testing," in Proceedings of the 23rd Annual CCC, pp. 268-279, 2008.
15. L. Babai, L. Fortnow, and C. Lund, "Non-deterministic exponential time has two-prover interactive protocols," Computational Complexity, vol. 1, pp. 3-40, 1991.
16. W. Baur and V. Strassen, "The complexity of partial derivatives," Theoretical Compter Science, vol. 22, pp. 317-330, 1983.
17. A. Beimel, F. Bergadano, N. H. Bshouty, E. Kushilevitz, and S. Varricchio, "Learning functions represented as multiplicity automata," Journal of the ACM, vol. 47, pp. 506-530, 2000.
18. M. Ben-Or and P. Tiwari, "A deterministic algorithm for sparse multivariate polynominal interpolation," in Proceedings of the 20th Annual STOC, pp. 301-309, 1988.
19. M. Bläser, "A 5/2n2-lower bound for the rank of n × n-matrix multiplication over arbitrary fields," in Proceedings of the 40th Annual FOCS, pp. 45-50, 1999.
20. M. Bläser, M. Hardt, R. J. Lipton, and N. K. Vishnoi, "Deterministically testing sparse polynomial identities of unbounded degree," Information Processing Letters, vol. 109, pp. 187-192, 2009.
21. L. Blum, F. Cucker, M. Shub, and S. Smale, Complexity and Real Computation. Springer, 1997.
22. M. Blum, A. K. Chandra, and M. N. Wegman, "Equivalence of free boolean graphs can be tested in polynomial time," Information Processing Letters, vol. 10, pp. 80-82, 1980.
23. A. Bogdanov and H.Wee, "More on noncommutative polynomial identity testing," in Proceedings of the 20th Annual IEEE Conference on Computational Complexity, pp. 92-99, 2005.
24. A. Borodin, J. von zur Gathen, and J. E. Hopcroft, "Fast parallel matrix and GCD computations," Information and Control, vol. 52, pp. 241-256, 1982. (Pubitemid 14484052)
25. M. R. Brown and D. P. Dobkin, "An improved lower bound on polynomial multiplication," IEEE Transactions on Computers, vol. 29, pp. 337-340, 1980.
26. D. Bshouty and N. H. Bshouty, "On interpolating arithmetic read-once formulas with exponentiation," Journal of Computer and System Sciences, vol. 56, pp. 112-124, 1998.
27. N. H. Bshouty and R. Cleve, "Interpolating arithmetic read-once formulas in parallel," SIAM Journal on Computing, vol. 27, pp. 401-413, 1998.
28. N. H. Bshouty, T. R. Hancock, and L. Hellerstein, "Learning arithmetic readonce formulas," SIAM Journal on Computing, vol. 24, pp. 706-735, 1995.
29. P. Bürgisser, "On the structure of valiant's complexity classes," Discrete Mathematics & Theoretical Computer Science, vol. 3, pp. 73-94, 1999.
30. P. Bürgisser, M. Clausen, and M. A. Shokrollahi, Algebraic Complexity Theory. Springer, 1997.
31. J. Cai, X. Chen, and D. Li, "A quadratic lower bound for the permanent and determinant problem over any characteristic != 2," in Proceedings of the 40th Annual STOC, pp. 491-498, 2008.
32. S. Chari, P. Rohatgi, and A. Srinivasan, "Randomness-optimal unique element isolation with applications to perfect matching and related problems," SIAM Journal on Computing, vol. 24, pp. 1036-1050, 1995.
33. B. Chazelle, "A spectral approach to lower bounds with applications to geometric searching," SIAM Journal on Computing, vol. 27, pp. 545-556, 1998.
34. Z. Chen and M. Kao, "Reducing randomness via irrational numbers," SIAM Journal on Computing, vol. 29, pp. 1247-1256, 2000.
35. S. Chien and A. Sinclair, "Algebras with polynomial identities and computing the determinant," SIAM Journal on Computing, vol. 37, pp. 252-266, 2007.
36. H. Cohn, R. D. Kleinberg, B. Szegedy, and C. Umans, "Group-theoretic algorithms for matrix multiplication," in Proceedings of the 46th Annual FOCS, pp. 379-388, 2005.
37. H. Cohn and C. Umans, "A group-theoretic approach to fast matrix multiplication," in Proceedings of the 44th Annual FOCS, pp. 438-449, 2003.
38. J. W. Cooley and J. W. Tukey, "An algorithm for the machine calculation of complex fourier series," Mathematics of Computation, vol. 19, pp. 297-301, 1965.
39. D. Coppersmith and S. Winograd, "Matrix multiplication via arithmetic progression," Journal of Symbolic Computation, vol. 9, pp. 251-280, 1990.
40. L. Csanky, "Fast parallel matrix inversion algorithms," SIAM Journal on Computing, vol. 5, pp. 618-623, 1976.
41. R. A. DeMillo and R. J. Lipton, "A probabilistic remark on algebraic program testing," Information Processing Letters, vol. 7, pp. 193-195, 1978.
42. Z. Dvir, "On matrix rigidity and locally self-correctable codes," in Proceedings of the 25th Annual CCC, pp. 291-298, 2010.
43. Z. Dvir and A. Shpilka, "Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits," SIAM Journal on Computing, vol. 36, pp. 1404-1434, 2006.
44. Z. Dvir, A. Shpilka, and A. Yehudayoff, "Hardness-randomness tradeoffs for bounded depth arithmetic circuits," SIAM Journal on Computing, vol. 39, pp. 1279-1293, 2009.
45. M. Edelstein and L. M. Kelly, "Bisecants of finite collections of sets in linear spaces," Canadanian Journal of Mathematics, vol. 18, pp. 375-280, 1966.
46. L. Fortnow and A. R. Klivans, "Efficient learning algorithms yield circuit lower bounds," Journal of Computer System Science, vol. 75, pp. 27-36, 2009.
47. A. Gabizon and R. Raz, "Deterministic extractors for affine sources over large fields," Combinatorica, vol. 28, pp. 415-440, 2008.
48. O. Goldreich, S. Goldwasser, and S. Micali, "How to construct random functions," Journal of the ACM, vol. 33, pp. 792-807, 1986.
49. D. Grigoriev and M. Karpinski, "The matching problem for bipartite graphs with polynomially bounded permanents is in NC (extended abstract)," in Proceedings of the 28th Annual FOCS, pp. 166-172, 1987.
50. D. Grigoriev and M. Karpinski, "An exponential lower bound for depth 3 arithmetic circuits," in Proceedings of the 30th Annual STOC, pp. 577-582, 1998.
51. D. Grigoriev, M. Karpinski, and M. F. Singer, "Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields," SIAM Journal on Computing, vol. 19, pp. 1059-1063, 1990.
52. D. Grigoriev and A. A. Razborov, "Exponential complexity lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields," Applicable Algebra in Engineering, Communication and Computing, vol. 10, pp. 465- 487, 2000.
53. J. Håstad, "Almost optimal lower bounds for small depth circuits," in Proceedings of the 18th Annual STOC, pp. 6-20, 1986.
54. J. Håstad, "Tensor rank is np-complete," Journal of Algorithms, vol. 11, pp. 644-654, 1990.
55. T. R. Hancock and L. Hellerstein, "Learning read-once formulas over fields and extended bases," in Proceedings of the 4th Annual COLT, pp. 326-336, 1991.
56. J. Heintz and C. P. Schnorr, "Testing polynomials which are easy to compute (extended abstract)," in Proceedings of the 12th annual STOC, pp. 262-272, 1980.
57. J. Heintz and M. Sieveking, "Lower bounds for polynomials with algebraic coefficients," Theoretical Computer Science, vol. 11, pp. 321-330, 1980.
58. S. Hoory, N. Linial, and A. Wigderson, "Expander graphs and their applications," Bulletin of the American Mathematical Society, vol. 43, pp. 439-561, 2006.
59. J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation. Pearson Education, 2nd ed., 2000.
60. P. Hrubeš, A. Wigderson, and A. Yehudayoff, "Non-commutative circuits and the sum-of-squares problem," in Proceedings of the 42nd Annual ACM Symposium on Theory of Computing (STOC), pp. 667-676, 2010.
61. P. Hrubeš, A. Wigderson, and A. Yehudayoff, "Relationless completeness and separations," in Proceedings of the 25th Conference on Computational Complexity, pp. 280-290, 2010.
62. P. Hrubeš and A. Yehudayoff, "Arithmetic complexity in algebraic extensions," Manuscript, 2009.
63. P. Hrubeš and A. Yehudayoff, "Homogeneous formulas and symmetric polynomials," CoRR, abs/0907.2621, 2009.
64. P. Hrubeš and A. Yehudayoff, "Monotone separations for constant degree polynomials," Information Processing Letters, vol. 110, pp. 1-3, 2009.
65. R. Impagliazzo, V. Kabanets, and A. Wigderson, "In search of an easy witness: Exponential time vs. probabilistic polynomial time," Journal of Computer and System Sciences, vol. 65, pp. 672-694, 2002. (Pubitemid 41161945)
66. R. Impagliazzo and A. Wigderson, "P=BPP unless E has subexponential circuits: Derandomizing the XOR lemma," in Proceedings of the 29th STOC, pp. 220-229, 1997.
67. M. Jansen, Y. Qiao, and J. Sarma, "Deterministic identity testing of read-once algebraic branching programs," CoRR, abs/0912.2565, 2009.
68. M. Jerrum and M. Snir, "Some exact complexity results for straight-line computations over semi-rings," Technical Report CRS-58-80, University of Edinburgh, 1980.
69. V. Kabanets and R. Impagliazzo, "Derandomizing polynomial identity tests means proving circuit lower bounds," Computational Complexity, vol. 13, pp. 1-46, 2004.
70. K. Kalorkoti, "A lower bound for the formula size of rational functions," SIAM Journal of Computing, vol. 14, pp. 678-687, 1985.
71. E. Kaltofen, "Factorization of polynomials given by straight-line programs," in Randomness in Computation, vol. 5 of Advances in Computing Research, (S. Micali, ed.), pp. 375-412, 1989.
72. E. Kaltofen, "Polynomial factorization: A success story," in ISSAC, pp. 3-4, 2003.
73. E. Kaltofen and B. M. Trager, "Computing with polynomials given by black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators," Journal of Symbolic Computation, vol. 9, pp. 301-320, 1990.
74. M. Kaminski, "A lower bound on the complexity of polynomial multiplication over finite fields," SIAM Journal on Computing, vol. 34, pp. 960-992, 2005. (Pubitemid 41247002)
75. Z. S. Karnin, P. Mukhopadhyay, A. Shpilka, and I. Volkovich, "Deterministic identity testing of depth 4 multilinear circuits with bounded top fan-in," in Proceedings of the 42nd Annual STOC, pp. 649-658, 2010.
76. Z. S. Karnin and A. Shpilka, "Deterministic black box polynomial identity testing of depth-3 arithmetic circuits with bounded top fan-in," in Proceedings of the 23rd Annual CCC, pp. 280-291, 2008.
77. Z. S. Karnin and A. Shpilka, "Reconstruction of generalized depth-3 arithmetic circuits with bounded top fan-in," in Proceedings of the 24th Annual CCC, pp. 274-285, 2009.
78. R. Karp, E. Upfal, and A. Wigderson, "Constructing a perfect matching is in random NC," Combinatorica, vol. 6, pp. 35-48, 1, 1986.
79. N. Kayal, "Derandomizing some number-theoretic and algebraic algorithms," PhD thesis, Indian Institute of Technology, Kanpur, India, 2007.
80. N. Kayal and S. Saraf, "Blackbox polynomial identity testing for depth 3 circuits," in Proceedings of the 50th Annual FOCS, pp. 198-207, 2009.
81. N. Kayal and N. Saxena, "Polynomial identity testing for depth 3 circuits," Computational Complexity, vol. 16, pp. 115-138, 2007.
82. M. J. Kearns and L. G. Valiant, "Cryptographic limitations on learning boolean formulae and finite automata," Journal of the ACM, vol. 41, pp. 67- 95, 1994.
83. M. J. Kearns and U. V. Vazirani, An Introduction to Computational Learning Theory. Cambridge, MA, USA: MIT Press, 1994.
84. K. S. Kedlaya and C. Umans, "Fast modular composition in any characteristic," in Proceedings of the 49th Annual Symposium on Foundations of Computer Science (FOCS), pp. 146-155, 2008.
85. A. Klivans and A. Shpilka, "Learning restricted models of arithmetic circuits," Theory of Computing, vol. 2, pp. 185-206, 2006.
86. A. Klivans and D. Spielman, "Randomness efficient identity testing of multivariate polynomials," in Proceedings of the 33rd Annual STOC, pp. 216-223, 2001.
87. A. R. Klivans and A. A. Sherstov, "Cryptographic hardness for learning intersections of halfspaces," Journal of Computer and System Sciences, vol. 75, pp. 2-12, 2009.
88. P. Koiran, "Arithmetic circuits: The chasm at depth four gets wider," CoRR, abs/1006.4700, 2010.
89. D. Lewin and S. Vadhan, "Checking polynomial identities over any field: Towards a derandomization?," in Proceedings of the 30th Annual STOC, pp. 428-437, 1998.
90. L. Lovasz, "On determinants, matchings, and random algorithms," in Fundamentals of Computing Theory, (L. Budach, ed.), Akademia-Verlag, 1979.
91. C. Lund, L. Fortnow, H. Karloff, and N. Nisan, "Algebraic methods for interactive proof systems," Journal of the ACM, vol. 39, pp. 859-868, 1992.
92. T. Mignon and N. Ressayre, "A quadratic bound for the determinant and permanent problem," International Mathematics Research Notices, vol. 79, pp. 4241-4253, 2004.
93. P. Morandi, Graduate Texts in Mathematics 167: Field and Galois Theory. Springer-Verlag, New York, 1996.
94. J. Morgenstern, "Note on a lower bound on the linear complexity of the fast Fourier transform," Journal of the ACM, vol. 20, pp. 305-306, 1973.
95. K. Mulmuley and M. A. Sohoni, "Geometric complexity theory i: An approach to the P vs. NP and related problems," SIAM Journal on Computing, vol. 31, pp. 496-526, 2001.
96. K. Mulmuley and M. A. Sohoni, "Geometric complexity theory ii: Towards explicit obstructions for embeddings among class varieties," SIAM Journal on Computing, vol. 38, pp. 1175-1206, 2008.
97. K. Mulmuley, U. Vazirani, and V. Vazirani, "Matching is as easy as matrix inversion," Combinatorica, vol. 7, pp. 105-113, 1987.
98. N. Nisan, "Lower bounds for non-commutative computation," in Proceedings of the 23rd Annual STOC, pp. 410-418, 1991.
99. N. Nisan and A. Wigderson, "Hardness vs. randomness," Journal of Computer System Sciences, vol. 49, pp. 149-167, 1994.
100. N. Nisan and A. Wigderson, "Lower bound on arithmetic circuits via partial derivatives," Computational Complexity, vol. 6, pp. 217-234, 1996.
101. R. Raz, "On the complexity of matrix product," SIAM Journal on Computing, vol. 32, pp. 1356-1369, 2003.
102. R. Raz, "Separation of multilinear circuit and formula size," Theory of Computing, vol. 2, pp. 121-135, 2006.
103. R. Raz, "Elusive functions and lower bounds for arithmetic circuits," in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), pp. 711-720, 2008.
104. R. Raz, "Multi-linear formulas for permanent and determinant are of superpolynomial size," Journal of the ACM, vol. 56, 2009.
105. R. Raz, "Tensor-rank and lower bounds for arithmetic formulas," in Proceedings of the 42nd Annual STOC, pp. 659-666, 2010.
106. R. Raz and A. Shpilka, "Deterministic polynomial identity testing in non commutative models," Computational Complexity, vol. 14, pp. 1-19, 2005.
107. R. Raz, A. Shpilka, and A. Yehudayoff, "A lower bound for the size of syntactically multilinear arithmetic circuits," SIAM Journal on Computing, vol. 38, pp. 1624-1647, 2008.
108. R. Raz and A. Yehudayoff, "Balancing syntactically multilinear arithmetic circuits," Computational Complexity, vol. 17, pp. 515-535, 2008.
109. R. Raz and A. Yehudayoff, "Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors," in Proceedings of the 49th Annual FOCS, pp. 273-282, 2008.
110. R. Raz and A. Yehudayoff, "Lower bounds and separations for constant depth multilinear circuits," Computational Complexity, vol. 18, pp. 171-207, 2009.
111. A. A. Razboeov and S. Rudich, "Natural proofs," Journal of Computer and System Sciences, vol. 55, pp. 24-35, 1997.
112. A. A. Razborov, "Lower bounds for the size of circuits with bounded depth with basis {Λ,⊕}," Matematicheskie Zametki, pp. 598-607, 1987. in Russian.
113. O. Regev, "On lattices, learning with errors, random linear codes, and cryptography," Journal of the ACM, vol. 56, 2009.
114. H. J. Ryser, Combinatorial Mathematics, vol. 14. Carus Mathematical Monographs, 1963.
115. S. Saraf and I. Volkovich, "Black-box identity testing of depth-4 multilinear circuits," Manuscript, 2010.
116. N. Saxena, "Diagonal circuit identity testing and lower bounds," in ICALP (1), pp. 60-71, 2008.
117. N. Saxena and C. Seshadhri, "An almost optimal rank bound for depth-3 identities," in Proceedings of the 24th Annual CCC, pp. 137-148, 2009.
118. N. Saxena and C. Seshadhri, "From Sylvester-Gallai configurations to rank bounds: Improved black-box identity test for deph-3 circuits," in Proceedings of the 51st Annual FOCS, pp. 21-30, 2010.
119. J. T. Schwartz, "Fast probabilistic algorithms for verification of polynomial identities," Journal of the ACM, vol. 27, pp. 701-717, 1980.
120. A. Shamir, "IP = PSPACE," Journal of the ACM, vol. 39, pp. 869-877, 1992.
121. E. Shamir and M. Snir, "Lower bounds on the number of multiplications and the number of additions in monotone computations," Technical Report RC- 6757, IBM, 1977.
122. V. Shoup and R. Smolensky, "Lower bounds for polynomial evaluation and interpolation problems," in SFCS '91: Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, pp. 378-383, Washington, DC, USA: IEEE Computer Society, 1991.
123. A. Shpilka, "Affine projections of symmetric polynomials," Journal of Computer and System Sciences, vol. 65, pp. 639-659, 2002. (Pubitemid 41161943)
124. A. Shpilka, "Lower bounds for matrix product," SIAM Journal on Computing, vol. 32, pp. 1185-1200, 2003.
125. A. Shpilka, "Interpolation of depth-3 arithmetic circuits with two multiplication gates," SIAM Journal on Computing, vol. 38, pp. 2130-2161, 2009.
126. A. Shpilka and I. Volkovich, "Read-once polynomial identity testing," in Proceedings of the 40th Annual STOC, pp. 507-516, 2008.
127. A. Shpilka and I. Volkovich, "Improved polynomial identity testing for readonce formulas," in APPROX-RANDOM, pp. 700-713, 2009.
128. A. Shpilka and I. Volkovich, "On the relation between polynomial identity testing and finding variable disjoint factors," in ICALP (1), pp. 408-419, 2010.
129. A. Shpilka and A. Wigderson, "Depth-3 arithmetic circuits over fields of characteristic zero," Computational Complexity, vol. 10, pp. 1-27, 2001.
130. R. Smolensky, "Algebraic methods in the theory of lower bounds for Boolean circuit complexity," in Proceedings of the 19th Annual STOC, pp. 77-82, 1987.
131. V. Strassen, "Gaussian elimination is not optimal," Numerische Mathematik, vol. 13, pp. 354-356, 1969.
132. V. Strassen, "Die berechnungskomplexiät von elementarsymmetrischen funktionen und von interpolationskoeffizienten," Numerische Mathematik, vol. 20, pp. 238-251, 1973.
133. V. Strassen, "Vermeidung von divisionen," The Journal für die Reine und Angewandte Mathematik, vol. 264, pp. 182-202, 1973.
134. V. Strassen, "Algebraic complexity theory," in Handbook of Theoretical Computer Science, vol. A: Algorithms and Complexity (A), pp. 633-672, Elsevier and MIT Press, 1990.
135. P. Tiwari and M. Tompa, "A direct version of Shamir and Snir's lower bounds on monotone circuit depth," Information Processing Letters, vol. 49, pp. 243- 248, 1994.
136. S. Toda, "PP is as hard as the polynomial time hierarchy," SIAM Journal on Computing, vol. 20, pp. 865-877, 1991.
137. L. G. Valiant, "Graph-theoretic arguments in low-level complexity," in Lecture notes in Computer Science, vol. 53, pp. 162-176, Springer, 1977.
138. L. G. Valiant, "Completeness classes in algebra," in Proceedings of the 11th Annual STOC, pp. 249-261, 1979.
139. L. G. Valiant, "The complexity of computing the permanent," Theoretical Computer Science, vol. 8, pp. 189-201, 1979.
140. L. G. Valiant, "Negation can be exponentially powerful," Theoretical Computer Science, vol. 12, pp. 303-314, November 1980.
141. L. G. Valiant, "Reducibility by algebraic projections," L'Enseignement Mathematique, vol. 28, pp. 253-268, 1982.
142. L. G. Valiant, "A theory of the learnable," Communications of the ACM, vol. 27, pp. 1134-1142, 1984.
143. L. G. Valiant, S. Skyum, S. Berkowitz, and C. Rackoff, "Fast parallel computation of polynomials using few processors," SIAM Journal on Computing, vol. 12, pp. 641-644, November 1983.
144. E. Viola, "The sum of small-bias generators fools polynomials of degree," Computational Complexity, vol. 18, pp. 209-217, 2009.
145. J. von zur Gathen, "Feasible arithmetic computations: Valiant's hypothesis," Journal of Symbolic Computation, vol. 4, pp. 137-172, 1987.
146. J. von zur Gathen, "Who was who in polynomial factorization," in ISSAC, p. 2, 2006.
147. J. von zur Gathen and J. Gerhard, Modern Computer Algebra. Cambridge University Press, 1999.
148. R. Zippel, "Probabilistic algorithms for sparse polynomials," in Symbolic and Algebraic Computation, pp. 216-226, 1979.