A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs
暂无分享,去创建一个
[1] Prasad Raghavendra,et al. Approximating CSPs with global cardinality constraints using SDP hierarchies , 2011, SODA.
[2] Irit Dinur,et al. The PCP theorem by gap amplification , 2006, STOC.
[3] Irit Dinur,et al. Mildly exponential reduction from gap 3SAT to polynomial-gap label-cover , 2016, Electron. Colloquium Comput. Complex..
[4] Aranyak Mehta,et al. Playing large games using simple strategies , 2003, EC '03.
[5] Jean B. Lasserre,et al. Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..
[6] Venkatesan Guruswami,et al. Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[7] Madhur Tulsiani. CSP gaps and reductions in the lasserre hierarchy , 2009, STOC '09.
[8] Pasin Manurangsi,et al. Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph , 2016, STOC.
[9] Wenceslas Fernandez de la Vega,et al. Linear programming relaxations of maxcut , 2007, SODA '07.
[10] Dana Moshkovitz,et al. The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover , 2012, Theory Comput..
[11] Yuan Zhou,et al. Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems , 2014, ITCS.
[12] Russell Impagliazzo,et al. Complexity of k-SAT , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).
[13] László Babai,et al. Trading group theory for randomness , 1985, STOC '85.
[14] Aditya Bhaskara,et al. Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph , 2011, SODA.
[15] David Peleg,et al. Approximation algorithms for the Label-CoverMAX and Red-Blue Set Cover problems , 2000, J. Discrete Algorithms.
[16] Yuan Zhou,et al. Approximation Algorithms and Hardness of the k-Route Cut Problem , 2011, TALG.
[17] Ran Raz,et al. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.
[18] Aviad Rubinstein,et al. ETH-Hardness for Signaling in Symmetric Zero-Sum Games , 2015, ArXiv.
[19] Odalric-Ambrym Maillard,et al. Concentration inequalities for sampling without replacement , 2013, 1309.4029.
[20] Aditya Bhaskara,et al. Detecting high log-densities: an O(n¼) approximation for densest k-subgraph , 2010, STOC '10.
[21] Omri Weinstein,et al. ETH Hardness for Densest-k-Subgraph with Perfect Completeness , 2015, SODA.
[22] Noga Alon,et al. Random sampling and approximation of MAX-CSPs , 2003, J. Comput. Syst. Sci..
[23] Prasad Raghavendra,et al. Rounding Semidefinite Programming Hierarchies via Global Correlation , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[24] Santosh S. Vempala,et al. Tensor decomposition and approximation schemes for constraint satisfaction problems , 2005, STOC '05.
[25] Vangelis Th. Paschos,et al. Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse , 2015, STACS.
[26] Mark Braverman,et al. Approximating the best Nash Equilibrium in no(log n)-time breaks the Exponential Time Hypothesis , 2015, Electron. Colloquium Comput. Complex..
[27] Guy Kortsarz,et al. On choosing a dense subgraph , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[28] David Steurer,et al. Analytical approach to parallel repetition , 2013, STOC.
[29] Ran Raz,et al. Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner , 2012, ICALP.
[30] Michael Dinitz,et al. The Densest k-Subhypergraph Problem , 2016, APPROX-RANDOM.
[31] Yakov Babichenko,et al. Can Almost Everybody be Almost Happy? , 2015, ITCS.
[32] Uriel Feige,et al. The Dense k -Subgraph Problem , 2001, Algorithmica.
[33] U. Feige,et al. On the densest k-subgraph problems , 1997 .
[34] Alan M. Frieze,et al. An efficient sparse regularity concept , 2009, SODA.
[35] Pasin Manurangsi,et al. Improved Approximation Algorithms for Projection Games , 2015, Algorithmica.
[36] Pasin Manurangsi,et al. Inapproximability of VC Dimension and Littlestone's Dimension , 2017, COLT.
[37] Marek Karpinski,et al. Polynomial time approximation schemes for dense instances of NP-hard problems , 1995, STOC '95.
[38] Thomas Holenstein. Parallel Repetition: Simplification and the No-Signaling Case , 2009, Theory Comput..
[39] Russell Impagliazzo,et al. AM with Multiple Merlins , 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).
[40] Stephen A. Cook,et al. Short Propositional Formulas Represent Nondeterministic Computations , 1988, Inf. Process. Lett..
[41] Ran Raz. A Parallel Repetition Theorem , 1998, SIAM J. Comput..
[42] Mohammad Taghi Hajiaghayi,et al. Improved Approximation Algorithms for Label Cover Problems , 2011, Algorithmica.
[43] Bill Fefferman,et al. The Power of Unentanglement , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.
[44] Carsten Lund,et al. Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.
[45] Ran Raz,et al. Two Query PCP with Sub-Constant Error , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[46] Shaddin Dughmi,et al. On the Hardness of Signaling , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[47] Pasin Manurangsi,et al. On approximating projection games , 2015 .
[48] Claire Mathieu,et al. Yet another algorithm for dense max cut: go greedy , 2008, SODA '08.
[49] Pasin Manurangsi,et al. Approximating Dense Max 2-CSPs , 2015, APPROX-RANDOM.
[50] David Steurer,et al. Subsampling mathematical relaxations and average-case complexity , 2009, SODA '11.
[51] J. Lasserre,et al. Handbook on Semidefinite, Conic and Polynomial Optimization , 2012 .
[52] Aviad Rubinstein,et al. Settling the Complexity of Computing Approximate Two-Player Nash Equilibria , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[53] Yuan Zhou,et al. Hypercontractivity, sum-of-squares proofs, and their applications , 2012, STOC '12.
[54] Madhu Sudan,et al. Improved Low-Degree Testing and its Applications , 1997, STOC '97.
[55] Ran Raz,et al. PCP characterizations of NP: towards a polynomially-small error-probability , 1999, STOC '99.
[56] Alan M. Frieze,et al. The regularity lemma and approximation schemes for dense problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[57] Dana Moshkovitz,et al. Parallel Repetition from Fortification , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[58] Russell Impagliazzo,et al. Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[59] Thomas Holenstein,et al. Parallel repetition: simplifications and the no-signaling case , 2007, STOC '07.
[60] Dima Grigoriev,et al. Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity , 2001, Theor. Comput. Sci..
[61] Grigory Yaroslavtsev. Going for Speed: Sublinear Algorithms for Dense r-CSPs , 2014, ArXiv.
[62] Takeshi Tokuyama,et al. Dense subgraph problems with output-density conditions , 2005, TALG.
[63] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[64] Mark Braverman,et al. Small Value Parallel Repetition for General Games , 2014, STOC.
[65] Monique Laurent,et al. A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0-1 Programming , 2003, Math. Oper. Res..
[66] A. Russell,et al. The Minimum k-Colored Subgraph Problem in Haplotyping and DNA Primer Selection , 2004 .
[67] Ashley Montanaro,et al. Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization , 2010, JACM.
[68] Aravindan Vijayaraghavan,et al. Approximation Algorithms for Label Cover and The Log-Density Threshold , 2017, SODA.
[69] Grant Schoenebeck,et al. Linear Level Lasserre Lower Bounds for Certain k-CSPs , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[70] Anup Rao,et al. Parallel repetition in projection games and a concentration bound , 2008, SIAM J. Comput..
[71] Benny Applebaum,et al. Pseudorandom generators with long stretch and low locality from random local one-way functions , 2012, STOC '12.
[72] Warren P. Adams,et al. A hierarchy of relaxation between the continuous and convex hull representations , 1990 .