暂无分享,去创建一个
[1] Nathan Linial,et al. The influence of variables on Boolean functions , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[2] Guy Kindler,et al. Towards a proof of the 2-to-1 games conjecture? , 2018, Electron. Colloquium Comput. Complex..
[3] Ryan O'Donnell,et al. Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? , 2007, SIAM J. Comput..
[4] Mikhail Kapralov,et al. An optimal space lower bound for approximating MAX-CUT , 2019, STOC.
[5] Ryan O'Donnell,et al. Analysis of Boolean Functions , 2014, ArXiv.
[6] Uriel Feige,et al. On Systems of Linear Equations with Two Variables per Equation , 2004, APPROX-RANDOM.
[7] Venkatesan Guruswami,et al. Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph , 2017, APPROX-RANDOM.
[8] Aravind Srinivasan,et al. Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds , 1997, SIAM J. Comput..
[9] Subhash Khot,et al. Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[10] Ran Raz,et al. Exponential separations for one-way quantum communication complexity, with applications to cryptography , 2006, STOC '07.
[11] Prasad Raghavendra,et al. Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[12] Subhash Khot,et al. On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[13] Moses Charikar,et al. Near-optimal algorithms for unique games , 2006, STOC '06.
[14] Sanjeev Khanna,et al. Streaming Lower Bounds for Approximating MAX-CUT , 2014, SODA.
[15] Wei Yu,et al. The streaming complexity of cycle counting, sorting by reversals, and other problems , 2011, SODA '11.
[16] Prasad Raghavendra,et al. Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant , 2011, SIAM J. Comput..