Institute for Interdisciplinary Information Sciences
Name: Chenggang Wu
Research Interest: analysis of boolean functions, property testing,computational learning theory ,hardness of approximations and LP/SDP hierarchies.
Telephone: 86-10-62797304 86-10-62783521 Ext.1629
Address: 4-609,FIT, Tsinghua University, Beijing, China 100084
From October 2012 to June 2013 I was a visiting scholar at Carnegie Mellon University. It's my great honour to have Prof. Ryan O'Donnell as my host.
|My research interests lie in analysis of boolean functions, property testing , computational learning theory., hardness of approximations and LP/SDP hierarchies.|
1 Joshua Brody, Kevin Matulef, Chenggang Wu. Lower Bounds for Testing Computability by Small Width OBDDs. The 8th Annual Conference on Theory and Applications of Models of Computation (TAMC 2011), pp. 320-331, May 23-25, 2011, Tokyo, Japan
2 Pravesh Kothari, Amir Neyyeri, Ryan O'Donnell, Chenggang Wu. Testing Surface Area. ACM-SIAM Symposium on Discrete Algorithms (SODA 2014). To appear.
3 Ryan O'Donnell, John Wright, Chenggang Wu, Yuan Zhou. Hardness of Robust Graph Isomorphism, Lasserre Gaps, and Assymetry of Random Graphs. ACM-SIAM Symposium on Discrete Algorithms (SODA 2014). To appear.
4. Andrew Wan, John Wright, Chenggang Wu. Decision Trees, Protocols, and the Fourier Entropy-Influence Conjecture. ITCS 2014, To appear.