Rigid Matrices From Rectangular PCPs or: Hard Claims Have Complex Proofs
暂无分享,去创建一个
[1] Henning Wunderlich. On a Theorem of Razborov , 2011, computational complexity.
[2] Eli Ben-Sasson,et al. Randomness-efficient low degree tests and short PCPs via epsilon-biased sets , 2003, STOC '03.
[3] 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.
[4] Ryan Williams,et al. Natural proofs versus derandomization , 2012, STOC '13.
[5] Irit Dinur,et al. The PCP theorem by gap amplification , 2006, STOC.
[6] Joel Friedman,et al. A note on matrix rigidity , 1993, Comb..
[7] Timothy M. Chan,et al. Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky , 2016, SODA.
[8] Zeev Dvir,et al. Matrix rigidity and the Croot-Lev-Pach lemma , 2017, Theory Comput..
[9] Ryan Williams,et al. Improving exhaustive search implies superpolynomial lower bounds , 2010, STOC '10.
[10] Ryan Williams. Nonuniform ACC Circuit Lower Bounds , 2014, JACM.
[11] Thilo Mie,et al. Short PCPPs verifiable in polylogarithmic time with O(1) queries , 2009, Annals of Mathematics and Artificial Intelligence.
[12] Michael J. Fischer,et al. Relations Among Complexity Measures , 1979, JACM.
[13] Richard Ryan Williams,et al. Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity , 2019, CCC.
[14] Eli Ben-Sasson,et al. Short PCPs with Polylog Query Complexity , 2008, SIAM J. Comput..
[15] Johan Håstad,et al. Optimal Inapproximability with Universal Factor Graphs , 2019, Electron. Colloquium Comput. Complex..
[16] Avishay Tal,et al. Matrix rigidity of random Toeplitz matrices , 2016, computational complexity.
[17] Daniel A. Spielman,et al. A Remark on Matrix Rigidity , 1997, Inf. Process. Lett..
[18] Emanuele Viola,et al. Short PCPs with Projection Queries , 2014, ICALP.
[19] Uriel Feige,et al. Universal Factor Graphs , 2012, ICALP.
[20] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[21] Daniel A. Spielman,et al. Linear-time encodable and decodable error-correcting codes , 1995, STOC '95.
[22] Stephen A. Cook,et al. Short Propositional Formulas Represent Nondeterministic Computations , 1988, Inf. Process. Lett..
[23] Ran Raz,et al. Sub-constant error low degree test of almost-linear size , 2006, STOC '06.
[24] Oded Goldreich,et al. Locally testable codes and PCPs of almost-linear length , 2006, JACM.
[25] Rahul Santhanam,et al. On Uniformity and Circuit Lower Bounds , 2014, computational complexity.
[26] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[27] Jonathan Katz,et al. On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.
[28] Luca Trevisan,et al. Inapproximability of Combinatorial Optimization Problems , 2004, Electron. Colloquium Comput. Complex..
[29] Eli Ben-Sasson,et al. Short PCPs verifiable in polylogarithmic time , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).
[30] Zeev Dvir,et al. Fourier and circulant matrices are not rigid , 2019, CCC.
[31] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[32] Josh Alman,et al. Efficient Construction of Rigid Matrices Using an NP Oracle , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).
[33] Richard Ryan Williams,et al. Probabilistic rank and matrix rigidity , 2016, STOC.
[34] Leslie G. Valiant,et al. Graph-Theoretic Arguments in Low-Level Complexity , 1977, MFCS.
[35] Omer Reingold,et al. Assignment testers: towards a combinatorial proof of the PCP-theorem , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[36] Irit Dinur,et al. Composition of Low-Error 2-Query PCPs Using Decodable PCPs , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[37] Oded Goldreich,et al. A Sample of Samplers - A Computational Perspective on Sampling (survey) , 1997, Electron. Colloquium Comput. Complex..
[38] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[39] Satyanarayana V. Lokam. Complexity Lower Bounds using Linear Algebra , 2009, Found. Trends Theor. Comput. Sci..
[40] Moni Naor,et al. Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.
[41] Eli Ben-Sasson,et al. Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding , 2004, SIAM J. Comput..
[42] J. Urry. Complexity , 2006, Interpreting Art.
[43] G. David Forney,et al. Concatenated codes , 2009, Scholarpedia.
[44] Stanislav Zák,et al. A Turing Machine Time Hierarchy , 1983, Theor. Comput. Sci..
[45] Orr Paradise,et al. Smooth and Strong PCPs , 2021, Electron. Colloquium Comput. Complex..
[46] Sanjeev Arora,et al. Computational Complexity: A Modern Approach , 2009 .