Algorithms for testing monomials in multivariate polynomials

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6831 LNCS, Issue , 2011, Pages 16-30

  Chen, Zhixiang ^a   Fu, Bin ^a   Liu, Yang ^a   Schweller, Robert ^a  

^a UNIVERSITY OF TEXAS PAN AMERICAN   (United States)

Author keywords

algebra; complexity; derandomization; monomial testing; Multivariate polynomials; randomization

Indexed keywords

COMPLEXITY; DERANDOMIZATION; MONOMIAL TESTING; MULTIVARIATE POLYNOMIAL; RANDOMIZATION; ARITHMETIC CIRCUIT; PRIME NUMBER; SUM PRODUCT; TIME ALGORITHMS;

ALGORITHMS; BEVERAGES; COMBINATORIAL OPTIMIZATION; INTEGRATING CIRCUITS; LOGIC CIRCUITS; MULTIVARIABLE SYSTEMS; OPTIMIZATION; ALGEBRA; POLYNOMIALS;

POLYNOMIALS; OPTIMIZATION;

EID: 80051980896     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22616-8_2     Document Type: Conference Paper

References (20)

1. Agrawal, M., Biswas, S.: Primality and identity testing via Chinese remaindering. Journal of the ACM 50(4), 429-443 (2003)
2. Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P. Ann. of Math. 160(2), 781-793 (2004)
3. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. Journal of the ACM 45(3), 501-555 (1998)
4. Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Information Processing Letters 8(3), 121-123 (1979)
5. Beigel, R.: The polynomial method in circuit compplexity. In: Proceedings of the Eighth Conference on Structure in Complexity Theory, pp. 82-95 (1993)
6. Chen, Z., Fu, B.: The complexity of testting monomials in multivariate polynomials. In: Proceedings of the Fifth International Conference on Combinatorial Optimization and Applications (2011)
7. Chen, Z., Fu, B.: Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials. In: Wu, W., Daescu, O. (eds.) COCOA 2010, Part I. LNCS, vol. 6508, pp. 309-323. Springer, Heidelberg (2010) (The full version will appear in Journal of Combinatorial Optimization)
8. Chen, J., Lu, S., Sze, S.-H., Zhang, F.: Improved algorithms for path, matching, and packing problems. In: SODA, pp. 298-307 (2007)
9. Downey, R.G., Fellows, M.R.: Fixed parameter tractability and completeness. II. On completeness for W(1). Theoretical Computer Science 141(1-2), 109-131 (1995)
10. Feige, U., Goldwasser, S., Lovász, L., Safra, S., Szegedy, M.: Interactive proofs and the hardness of approximating cliques. Journal of the ACM 43(2), 268-292 (1996)
11. Fu, B.: Separating PH from PP by relativization. Acta Math. Sinica 8(3), 329-336 (1992)
12. Kabanets, V., Impagliazzo, R.: Derandomizing polynomial identity tests means proving circuit lower bounds. In: STOC, pp. 355-364 (2003)
13. Õ(n1/3). In: STOC, pp. 258-265 (2001)
14. Koutis, I.: Faster algebraic algorithms for path and packing problems. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 575-586. Springer, Heidelberg (2008)
15. Minsky, M., Papert, S.: Perceptrons (expanded edition 1988). MIT Press, Cambridge (1968)
16. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
17. Naor, M., Schulman, L.J., Srinivasan, A.: Splitters and near-optimal derandomization. In: FOCS, pp. 182-191 (1995)
18. Raz, R., Shpilka, A.: Deterministic polynomial identity testing in non-commutative models. Computational Complexity 14(1), 1-19 (2005)
19. Shamir, A.: IP = PSPACE. Journal of the ACM 39(4), 869-877 (1992)
20. k) time. Information Processing Letters 109, 315-318 (2009)