Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > ZHIXIANG CHEN:
All reports by Author Zhixiang Chen:

TR10-124 | 18th July 2010
Zhixiang Chen, Bin Fu

Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials

This paper is our third step towards developing a theory of testing monomials in multivariate polynomials and concentrates on two problems: (1) How to compute the coefficients of multilinear monomials; and (2) how to find a maximum multilinear monomial when the input is a $\Pi\Sigma\Pi$ polynomial.
We first prove ... more >>>


TR10-122 | 18th July 2010
Zhixiang Chen, Bin Fu, Yang Liu, Robert Schweller

Algorithms for Testing Monomials in Multivariate Polynomials

This paper is our second step towards developing a theory of
testing monomials in multivariate polynomials. The central
question is to ask whether a polynomial represented by an
arithmetic circuit has some types of monomials in its sum-product
expansion. The complexity aspects of this problem and its variants
have been ... more >>>


TR10-114 | 17th July 2010
Zhixiang Chen, Bin Fu

The Complexity of Testing Monomials in Multivariate Polynomials

The work in this paper is to initiate a theory of testing
monomials in multivariate polynomials. The central question is to
ask whether a polynomial represented by certain economically
compact structure has a multilinear monomial in its sum-product
expansion. The complexity aspects of this problem and its variants
are investigated ... more >>>




ISSN 1433-8092 | Imprint