On testing monomials in multivariate polynomials

Theoretical Computer Science

Volumn 497, Issue , 2013, Pages 39-54

  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; Monomials; Multivariate polynomials; Randomization

Indexed keywords

COMPLEXITY; DERANDOMIZATION; MONOMIALS; MULTIVARIATE POLYNOMIAL; RANDOMIZATION;

ALGEBRA; ALGORITHMS; POLYNOMIALS;

MULTIVARIABLE SYSTEMS;

EID: 84881130765     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2012.03.038     Document Type: Article

References (28)

1. Manindra Agrawal, and Somenath Biswas Primality and identity testing via Chinese remaindering Journal of the ACM 50 4 2003 429 443
2. Manindra Agrawal, Neeraj Kayal, and Nitin Saxena PRIMES is in P Annals of Mathematics 160 2 2004 781 793
3. Sanjeev Arora, Carsten Lund, and Rajeev Motwani Madhu Sudan and Mario Szegedy, Proof verification and the hardness of approximation problems Journal of the ACM 45 3 1998 501555
4. Bengt Aspvall, Michael F. Plass, and Robert E. Tarjan A linear-time algorithm for testing the truth of certain quantified boolean formulas Information Processing Letters 8 3 1979 121 123
5. Richard Beigel The polynomial method in circuit complexity Proceedings of the Eighth Conference on Structure in Complexity Theory 1993 82 95
6. Andreas Björklund, Determinant sums for undirected hamilonicity, in: Proceedings of the 51th IEEE Foundations of Computer Science (FOCS'2010), 2010, pp. 173-182.
7. ZN-DNF formulas Proceedings of the Eighth Annual Conference on Computational Learning Theory (COLT 1995) 1995 ACM Santa Cruz, California, USA 198 205
8. Zhixiang Chen, and Bin Fu The Complexity of Testing Monomials in Multivariate Polynomials Proceedings of the Fourth International Conference on Combinatorial Optimization and Applications (COCOA'2011) LNCS vol. 6831 August 2011 1 15
9. Zhixiang Chen, and Bin Fu Approximating multilinear monomial coefficients and maximum multilinear monomials in multilinear polynomials Proceedings of the Fourth International Conference on Combinatorial Optimization and Applications (COCOA'2010) LNCS vol. 6508 2010 309 323 The full version will appear in Journal of Combinatorial Optimization, the Special Issue of COCOA'2010
10. Zhixiang Chen, Bin Fu, Yang Liu, and Robert T. Schweller Algorithms for Testing Monomials in Multivariate Polynomials Proceedings of the Fifth International Conference on Combinatorial Optimization and Applications (COCOA'2011) LNCS vol. 6831 2011 16 30
11. Jianer Chen, Songjian Lu, Sing-Hoi Sze, and Fenghui Zhang Improved algorithms for path, matching, and packing problems SODA 2007 298 307
12. Rod G. Downey, and Michael R. Fellows Fixed parameter tractability and completeness. II. On completeness for W[1] Theoretical Computer Science 141 1995 109 131
13. Ding-Zhu Du, and Ker-I Ko Theory of Computational Complexity 2000 John Wiley & Sons, INC 0-471-34506-7
14. Uriel Feige, Shafi Goldwasser, and Laszlo Lovász Shmuel Safra and Mario Szegedy, Interactive proofs and the hardness of approximating cliques Journal of the ACM (ACM) 43 2 1996 268292
15. Bin Fu Separating PH from PP by relativization Acta Mathematica Sinica 8 3 1992 329 336
16. / 2 algorithm for maximum matchings in bipartite graphs SIAM Journal on Computing 2 4 1973 225 231
17. Valentine Kabanets, and Russell Impagliazzo Derandomizing polynomial identity tests means proving circuit lower bounds STOC 2003 355 364
18. Adam Klivans, and Rocco A. Servedio Learning DNF in time 2O(n 1) STOC 2001 258 265
19. Ioannis Koutis Faster algebraic algorithms for path and packing problems Proceedings of the International Colloquium on Automata, Language and Programming (ICALP) LNCS vol. 5125 2008 Springer 575 586
20. Marvin L. Minsky, and Seymour A. Papert Perceptrons (expanded edition 1988) 1968 MIT Press
21. Rajeev Motwani, and Prabhakar Raghavan Randomized Algorithms 1995 Cambridge University Press
22. Moni Naor, Leonard J. Schulman, and Aravind Srinivasan Splitters and near-optimal derandomization FOCS 1995 182 191
23. Christos H. Papadimitriou Computational Complexity 1994 Addison-Wesley
24. Ran Raz, and Amir Shpilka Deterministic polynomial identity testing in non-commutative models Computational Complexity 14 1 2005 1 19
25. J.M. Robson Algorithms for maximum independent sets Journal of Algorithms 7 3 1986 425 440
26. Adi Shamir IP = PSPACE Journal of the ACM 39 4 1992 869 877
27. L. Valiant The complexity of computing the permanent Theoretical Computer Science 8 1979 189 201
28. k) time Information Processing Letters 109 2009 315 318