暂无分享,去创建一个
[1] Avi Wigderson,et al. In search of an easy witness: exponential time vs. probabilistic polynomial time , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.
[2] Van H. Vu,et al. Concentration of Multivariate Polynomials and Its Applications , 2000, Comb..
[3] Pravesh Kothari,et al. Semialgebraic Proofs and Efficient Algorithm Design , 2019, Electron. Colloquium Comput. Complex..
[4] Ryan O'Donnell,et al. How to Refute a Random CSP , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[5] Refutation of random constraint satisfaction problems using the sum of squares proof system , 2017 .
[6] Uriel Feige,et al. Witnesses for non-satisfiability of dense random 3CNF formulas , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[7] Prasad Raghavendra,et al. Strongly refuting random CSPs below the spectral threshold , 2016, STOC.
[8] Uriel Feige. Refuting Smoothed 3CNF Formulas , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[9] Noga Alon,et al. The Moore Bound for Irregular Graphs , 2002, Graphs Comb..
[10] Ryan O'Donnell,et al. Sum of squares lower bounds for refuting any CSP , 2017, STOC.
[11] Ran Raz,et al. Two Query PCP with Sub-Constant Error , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[12] Vangelis Th. Paschos,et al. Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse , 2015, STACS.
[13] Cristopher Moore,et al. The Kikuchi Hierarchy and Tensor PCA , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).
[14] Noga Alon,et al. On the power of two, three and four probes , 2009, SODA.
[15] Anup Rao. Coding for Sunflowers , 2019, ArXiv.
[16] Jacques Verstraëte,et al. Parity check matrices and product representations of squares , 2008, Comb..
[17] Shang-Hua Teng,et al. Smoothed Analysis (Motivation and Discrete Models) , 2003, WADS.
[18] Ankur Moitra,et al. Noisy tensor completion via the sum-of-squares hierarchy , 2015, Mathematical Programming.
[19] Siu On Chan,et al. Approximation resistance from pairwise independent subgroups , 2013, STOC '13.
[20] U. Feige,et al. Generalized Girth Problems in Graphs and Hypergraphs , 2013 .
[21] Domingos Dellamonica,et al. On Even-Degree Subgraphs of Linear Hypergraphs , 2012, Comb. Probab. Comput..
[22] Venkatesan Guruswami,et al. Strongly refuting all semi-random Boolean CSPs , 2020, SODA.
[23] Uriel Feige. Small Linear Dependencies for Binary Vectors of Low Weight , 2008 .
[24] Shachar Lovett,et al. Improved bounds for the sunflower lemma , 2019, Electron. Colloquium Comput. Complex..
[25] M. Murty. Ramanujan Graphs , 1965 .
[26] Joel A. Tropp,et al. User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..
[27] Maxim Sviridenko,et al. Concentration and moment inequalities for polynomials of independent random variables , 2012, SODA.
[28] Amin Coja-Oghlan,et al. Strong Refutation Heuristics for Random k-SAT , 2004, APPROX-RANDOM.
[29] Pravesh Kothari,et al. Sum of Squares Lower Bounds from Pairwise Independence , 2015, STOC.
[30] Kwangjun Ahn. A simpler strong refutation of random k-XOR , 2020, ArXiv.
[31] Marek Karpinski,et al. Polynomial time approximation schemes for dense instances of NP-hard problems , 1995, STOC '95.