The complexity of 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 1-15

  Chen, Zhixiang ^a   Fu, Bin ^a  

^a UNIVERSITY OF TEXAS PAN AMERICAN   (United States)

Author keywords

algebra; complexity; monomial testing; multilinear monomials; Multivariate polynomials

Indexed keywords

ALGEBRAIC PROPERTIES; COMPACT STRUCTURES; COMPLEXITY; CRITICAL PROBLEMS; MONOMIAL TESTING; MULTILINEAR MONOMIALS; MULTIVARIATE POLYNOMIAL; SUM PRODUCT;

BEVERAGES; COMBINATORIAL OPTIMIZATION; MULTIVARIABLE SYSTEMS; OPTIMIZATION; ALGEBRA;

POLYNOMIALS;

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

References (18)

1. Manindra, A., Neeraj, K., Nitin, S.: PRIMES is in P. Ann. of Math. 160(2), 781-793 (2004)
2. 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)
3. 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)
4. Beigel, R.: The polynomial method in circuit complexity. In: Proceedings of the Eighth Conference on Structure in Complexity Theory, pp. 82-95 (1993)
5. Bshouty, N.H., Chen, Z., Decatur, S.E., Homer, S.: One the learnability of ZN-DNF formulas. In: Proceedings of the Eighth Annual Conference on Computational Learning Theory (COLT 1995), pp. 198-205. ACM, Santa Cruz (1995)
6. 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)
7. Chen, Z., Fu, B., Liu, Y., Schweller, R.T.: Algorithms for Testing Monomials in Multivariate Polynomials. In: Proceedings of the Fifth International Conference on Combinatorial Optimization and Applications (2011)
8. 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)
9. Fu, B.: Separating PH from PP by relativization. Acta Math. Sinica 8(3), 329-336 (1992)
10. 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing 2(4), 225-231 (1973)
11. Kabanets, V., Impagliazzo, R.: Derandomizing polynomial identity tests means proving circuit lower bounds. In: STOC, pp. 355-364 (2003)
12. Õ(n1/3). In: STOC, pp. 258-265 (2001)
13. 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)
14. Minsky, M., Papert, S.: Perceptrons (expanded edition 1988). MIT Press, Cambridge (1968)
15. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
16. Robson, J.M.: Algorithms for maximum independent sets. Journal of Algorithms 7(3), 425-440 (1986)
17. Shamir, A.: IP = PSPACE. Journal of the ACM 39(4), 869-877 (1992)
18. k) time. Information Processing Letters 109, 315-318 (2009)