Fengming Wang

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Hellinger volume and number-on-the-forehead communication complexity Journal of Computer and System Sciences	2016-06-13	Paper
On the power of algebraic branching programs of width two Computational Complexity	2016-03-21	Paper
Uniform derandomization from pathetic lower bounds Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences	2015-08-21	Paper
scientific article; zbMATH DE number 5983545 (Why is no real title available?)	2011-12-01	Paper
On the power of algebraic branching programs of width two Automata, Languages and Programming	2011-07-06	Paper
NEXP does not have non-uniform quasipolynomial-size ACC circuits of \(o(\log \log n)\) depth Lecture Notes in Computer Science	2011-07-01	Paper
Extracting Kolmogorov complexity with applications to dimension zero-one laws Information and Computation	2011-04-28	Paper
Uniform Derandomization from Pathetic Lower Bounds Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques	2010-09-10	Paper
Robustness of PSPACE-complete sets Information Processing Letters	2010-03-24	Paper
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws Automata, Languages and Programming	2009-03-12	Paper

Research outcomes over time

This page was built for person: Fengming Wang