Bin Fu

most citedMultivariate Polynomial Integration and Derivative Are Polynomial Time Inapproximable unless P=NP

2 citations · 2 across the 2 of their papers we have counts for

collaborators

2 papers

cs.CC2010

NE is not NP Turing Reducible to Nonexpoentially Dense NP Sets

Bin Fu

A long standing open problem in the computational complexity theory is to separate NE from BPP, which is a subclass of $N P_{T} (N P \cap P / p o l y)$ . In this paper, we show that $NE\not\su…

cs.CC2010★ 2 cited

Multivariate Polynomial Integration and Derivative Are Polynomial Time Inapproximable unless P=NP

Bin Fu

We investigate the complexity of integration and derivative for multivariate polynomials in the standard computation model. The integration is in the unit cube $[0, 1]^{d}$ for a mult…