ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network
暂无分享,去创建一个
[1] Lijie Chen,et al. On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product , 2018, Electron. Colloquium Comput. Complex..
[2] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..
[3] Ran Raz,et al. Sub-Constant Error Probabilistically Checkable Proof of Almost-Linear Size , 2010, computational complexity.
[4] Vangelis Th. Paschos,et al. On Subexponential and FPT-Time Inapproximability , 2013, Algorithmica.
[5] Pasin Manurangsi,et al. On the parameterized complexity of approximating dominating set , 2017, Electron. Colloquium Comput. Complex..
[6] Michael Dinitz,et al. Approximating Spanners and Directed Steiner Forest , 2020, ACM Trans. Algorithms.
[7] David Steurer,et al. Analytical approach to parallel repetition , 2013, STOC.
[8] Guy Kortsarz,et al. Improved approximating algorithms for Directed Steiner Forest , 2009, SODA.
[9] Anupam Gupta,et al. Set connectivity problems in undirected graphs and the directed Steiner network problem , 2008, SODA '08.
[10] Pasin Manurangsi,et al. Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph , 2016, STOC.
[11] Or Meir,et al. Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[12] Eli Ben-Sasson,et al. Short PCPs with Polylog Query Complexity , 2008, SIAM J. Comput..
[13] Irit Dinur,et al. High Dimensional Expanders Imply Agreement Expanders , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[14] Irit Dinur,et al. Exponentially Small Soundness for the Direct Product Z-test , 2017, Electron. Colloquium Comput. Complex..
[15] Dana Moshkovitz,et al. Low-degree test with polynomially small error , 2017, computational complexity.
[16] Aviad Rubinstein,et al. Detecting communities is Hard (And Counting Them is Even Harder) , 2016, ITCS.
[17] Pasin Manurangsi,et al. Parameterized Approximation Algorithms for Directed Steiner Network Problems , 2017, ESA.
[18] Prasad Raghavendra,et al. A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs , 2016, ICALP.
[19] Guy Kindler,et al. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[20] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[21] Elchanan Mossel,et al. Approximation Resistant Predicates from Pairwise Independence , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.
[22] Madhu Sudan,et al. Improved Low-Degree Testing and its Applications , 1997, STOC '97.
[23] Ran Raz,et al. PCP characterizations of NP: towards a polynomially-small error-probability , 1999, STOC '99.
[24] Amir Abboud,et al. Reachability Preservers: New Extremal Bounds and Approximation Algorithms , 2017, SODA.
[25] Irit Dinur,et al. Mildly exponential reduction from gap 3SAT to polynomial-gap label-cover , 2016, Electron. Colloquium Comput. Complex..
[26] John Fearnley,et al. Inapproximability Results for Approximate Nash Equilibria , 2016, WINE.
[27] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[28] Omri Weinstein,et al. ETH Hardness for Densest-k-Subgraph with Perfect Completeness , 2015, SODA.
[29] Mohammad Taghi Hajiaghayi,et al. Improved Approximation Algorithms for Label Cover Problems , 2011, Algorithmica.
[30] Carsten Lund,et al. Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.
[31] Piotr Berman,et al. Approximation algorithms for spanner problems and Directed Steiner Forest , 2013, Inf. Comput..
[32] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[33] Subhash Khot. On the power of unique 2-prover 1-round games , 2002, STOC '02.
[34] Siu On Chan,et al. Approximation resistance from pairwise independent subgroups , 2013, STOC '13.
[35] Dima Grigoriev,et al. Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity , 2001, Theor. Comput. Sci..
[36] Ran Raz,et al. A parallel repetition theorem , 1995, STOC '95.
[37] Aviad Rubinstein,et al. Hardness of approximate nearest neighbor search , 2018, STOC.
[38] Guy Kindler,et al. Approximation of non-boolean 2CSP , 2016, SODA.
[39] Mohammad Taghi Hajiaghayi,et al. Fixed-Parameter and Approximation Algorithms: A New Look , 2013, IPEC.
[40] V. Sós,et al. On a problem of K. Zarankiewicz , 1954 .
[41] Aravindan Vijayaraghavan,et al. Approximation Algorithms for Label Cover and The Log-Density Threshold , 2017, SODA.
[42] Grant Schoenebeck,et al. Linear Level Lasserre Lower Bounds for Certain k-CSPs , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[43] David Peleg. Approximation algorithms for the Label-CoverMAX and Red-Blue Set Cover problems , 2007, J. Discrete Algorithms.
[44] Mark Braverman,et al. Approximating the best Nash Equilibrium in no(log n)-time breaks the Exponential Time Hypothesis , 2015, Electron. Colloquium Comput. Complex..
[45] Russell Impagliazzo,et al. AM with Multiple Merlins , 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).
[46] Eli Ben-Sasson,et al. Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding , 2004, SIAM J. Comput..
[47] Russell Impagliazzo,et al. Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[48] Aviad Rubinstein,et al. Honest Signaling in Zero-Sum Games Is Hard, and Lying Is Even Harder , 2015, ICALP.
[49] Sudipto Guha,et al. Approximation algorithms for directed Steiner problems , 1999, SODA '98.
[50] Bingkai Lin,et al. The Parameterized Complexity of k-Biclique , 2014, SODA.
[51] Richard Ryan Williams,et al. Distributed PCP Theorems for Hardness of Approximation in P , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[52] Pasin Manurangsi,et al. Improved Approximation Algorithms for Projection Games , 2015, Algorithmica.
[53] Pasin Manurangsi,et al. Inapproximability of VC Dimension and Littlestone's Dimension , 2017, COLT.
[54] Subhash Khot,et al. On Hardness of Approximating the Parameterized Clique Problem , 2016, Electron. Colloquium Comput. Complex..
[55] Avi Wigderson,et al. New direct-product testers and 2-query PCPs , 2009, STOC '09.
[56] Benny Applebaum,et al. Exponentially-Hard Gap-CSP and Local PRG via Local Hardcore Functions , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[57] 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).
[58] 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).
[59] Sanjeev Khanna,et al. Design networks with bounded pairwise distance , 1999, STOC '99.
[60] Guy Kindler,et al. Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition , 2015, STOC.
[61] 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.
[62] Pasin Manurangsi,et al. Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH , 2018, Electron. Colloquium Comput. Complex..
[63] Luca Trevisan,et al. From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[64] Mohammad Taghi Hajiaghayi,et al. The Foundations of Fixed Parameter Inapproximability , 2013, ArXiv.
[65] Yijia Chen,et al. The Constant Inapproximability of the Parameterized Dominating Set Problem , 2015, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[66] Prasad Raghavendra,et al. Optimal algorithms and inapproximability results for every CSP? , 2008, STOC.