Computational Complexity and Property Testing: On the Interplay Between Randomness and Computation
暂无分享,去创建一个
[1] Yael Tauman Kalai,et al. Delegating computation: interactive proofs for muggles , 2008, STOC.
[2] Roman Smolensky,et al. Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.
[3] Michael Luby,et al. How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract) , 1986, CRYPTO.
[4] Avi Wigderson,et al. On interactive proofs with a laconic prover , 2001, computational complexity.
[5] Clemens Lautemann,et al. BPP and the Polynomial Hierarchy , 1983, Inf. Process. Lett..
[6] Silvio Micali,et al. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.
[7] Luca Trevisan,et al. On Worst-Case to Average-Case Reductions for NP Problems , 2005, Electron. Colloquium Comput. Complex..
[8] Dana Ron,et al. Testing the diameter of graphs , 1999, RANDOM-APPROX.
[9] Gregory Valiant,et al. Estimating the unseen: an n/log(n)-sample estimator for entropy and support size, shown optimal via new CLTs , 2011, STOC '11.
[10] Liam Paninski,et al. A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data , 2008, IEEE Transactions on Information Theory.
[11] Dana Ron,et al. On Sample-Based Testers , 2016, TOCT.
[12] Rafail Ostrovsky,et al. Perfect Non-Interactive Zero Knowledge for NP , 2006, IACR Cryptol. ePrint Arch..
[13] Guy N. Rothblum,et al. Worst-case to Average-case reductions for subclasses of P , 2017, Electron. Colloquium Comput. Complex..
[14] Oded Goldreich,et al. Three XOR-Lemmas - An Exposition , 1995, Electron. Colloquium Comput. Complex..
[15] Noga Alon,et al. Simple construction of almost k-wise independent random variables , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[16] Oded Goldreich,et al. On Completeness and Soundness in Interactive Proof Systems , 1989, Adv. Comput. Res..
[17] N. Linial,et al. Expander Graphs and their Applications , 2006 .
[18] Mike Paterson,et al. Improved sorting networks withO(logN) depth , 1990, Algorithmica.
[19] Omer Reingold,et al. Assignment testers: towards a combinatorial proof of the PCP-theorem , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[20] Ronitt Rubinfeld,et al. Self-testing/correcting for polynomials and for approximate functions , 1991, STOC '91.
[21] Guy N. Rothblum,et al. Constant-Round Interactive Proofs for Delegating Computation , 2016, Electron. Colloquium Comput. Complex..
[22] Daniel M. Kane,et al. Testing Identity of Structured Distributions , 2014, SODA.
[23] Eric Blais. Testing juntas nearly optimally , 2009, STOC '09.
[24] Ronitt Rubinfeld,et al. Testing that distributions are close , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[25] Noam Nisan,et al. Lower bounds on arithmetic circuits via partial derivatives , 2005, computational complexity.
[26] Avi Wigderson,et al. On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions , 2013, Electron. Colloquium Comput. Complex..
[27] Noam Nisan,et al. On Yao's XOR-Lemma , 1995, Electron. Colloquium Comput. Complex..
[28] Leonid A. Levin,et al. A hard-core predicate for all one-way functions , 1989, STOC '89.
[29] Oded Goldreich. Hierarchy Theorems for Testing Properties in Size-Oblivious Query Complexity , 2019, computational complexity.
[30] Maria-Florina Balcan,et al. Active Property Testing , 2011, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[31] Zeev Dvir,et al. Fourier and circulant matrices are not rigid , 2019, CCC.
[32] Noam Nisan,et al. BPP has subexponential time simulations unlessEXPTIME has publishable proofs , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.
[33] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..
[34] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[35] Ilias Diakonikolas,et al. Optimal Algorithms for Testing Closeness of Discrete Distributions , 2013, SODA.
[36] Oded Goldreich. Flexible models for testing graph properties , 2018, Electron. Colloquium Comput. Complex..
[37] Oded Goldreich. On Testing Computability by Small Width OBDDs , 2010, Electron. Colloquium Comput. Complex..
[38] S. Goldwasser,et al. A Study of Statistical Zero-Knowledge Proofs , 2021 .
[39] Ueli Maurer,et al. Linking information reconciliation and privacy amplification , 1997, Journal of Cryptology.
[40] Boaz Barak,et al. How to go beyond the black-box simulation barrier , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[41] Dana Ron,et al. On Testing Expansion in Bounded-Degree Graphs , 2000, Studies in Complexity and Cryptography.
[42] K. Ramachandra,et al. Vermeidung von Divisionen. , 1973 .
[43] Dana Ron,et al. On proximity oblivious testing , 2009, STOC '09.
[44] Imre Csiszár,et al. Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.
[45] Yael Tauman Kalai,et al. Interactive PCP , 2007 .
[46] Manuel Blum,et al. Non-interactive zero-knowledge and its applications , 1988, STOC '88.
[47] Guy N. Rothblum,et al. Simple Doubly-Efficient Interactive Proof Systems for Locally-Characterizable Sets , 2017, ITCS.
[48] Silvio Micali,et al. How to construct random functions , 1986, JACM.
[49] Gregory Valiant,et al. Instance-by-instance optimal identity testing , 2013, Electron. Colloquium Comput. Complex..
[50] Oded Goldreich,et al. Locally testable codes and PCPs of almost-linear length , 2006, JACM.
[51] J. Håstad. Computational limitations of small-depth circuits , 1987 .
[52] Clément L. Canonne,et al. A Survey on Distribution Testing: Your Data is Big. But is it Blue? , 2020, Electron. Colloquium Comput. Complex..
[53] Venkatesan Guruswami,et al. Optimal Rate Code Constructions for Computationally Simple Channels , 2016, J. ACM.
[54] Carsten Lund,et al. Algebraic methods for interactive proof systems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[55] Oded Goldreich,et al. Improved bounds on the AN-complexity of multilinear functions , 2019, Electron. Colloquium Comput. Complex..
[56] Po-Shen Loh,et al. Probabilistic Methods in Combinatorics , 2009 .
[57] Amit Sahai,et al. Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK , 1998, CRYPTO.
[58] Dieter van Melkebeek,et al. A Survey of Lower Bounds for Satisfiability and Related Problems , 2007, Found. Trends Theor. Comput. Sci..
[59] David Chaum,et al. Minimum Disclosure Proofs of Knowledge , 1988, J. Comput. Syst. Sci..
[60] Dana Ron,et al. Chinese remaindering with errors , 1999, STOC '99.
[61] Pavel Pudlák,et al. Top-down lower bounds for depth-three circuits , 1995, computational complexity.
[62] Oded Goldreich,et al. Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..
[63] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..
[64] Ronitt Rubinfeld,et al. Tolerant property testing and distance approximation , 2006, J. Comput. Syst. Sci..
[65] Noam Nisan,et al. Pseudorandom bits for constant depth circuits , 1991, Comb..
[66] Dana Ron,et al. Testing Basic Boolean Formulae , 2002, SIAM J. Discret. Math..
[67] Mihir Bellare,et al. Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[68] Dana Ron,et al. Computational sample complexity , 1997, COLT '97.
[69] Dana Ron,et al. Property Testing in Bounded Degree Graphs , 2002, STOC '97.
[70] Ran Raz. Tensor-Rank and Lower Bounds for Arithmetic Formulas , 2013, JACM.
[71] E. Szemerédi,et al. O(n LOG n) SORTING NETWORK. , 1983 .
[72] Prashant Nalini Vasudevan,et al. Average-case fine-grained hardness , 2017, Electron. Colloquium Comput. Complex..
[73] Oded Goldreich. On the doubly-efficient interactive proof systems of GKR , 2017, Electron. Colloquium Comput. Complex..
[74] Silvio Micali,et al. Everything Provable is Provable in Zero-Knowledge , 1990, CRYPTO.
[75] Noga Alon,et al. Testing of Clustering , 2003, SIAM J. Discret. Math..
[76] Peter Bro Miltersen,et al. Efficient Multiparty Protocols via Log-Depth Threshold Formulae , 2013, Electron. Colloquium Comput. Complex..
[77] Roei Tell. On Being Far from Far and on Dual Problems in Property Testing: [Extended Abstract] , 2015, Electron. Colloquium Comput. Complex..
[78] Guy N. Rothblum,et al. Counting t-Cliques: Worst-Case to Average-Case Reductions and Direct Interactive Proof Systems , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[79] Lior Malka. How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge , 2008, TCC.
[80] Noga Alon,et al. Explicit Expanders of Every Degree and Size , 2020, Combinatorica.
[81] Dana Ron,et al. Tight Bounds for Testing Bipartiteness in General Graphs , 2004, RANDOM-APPROX.
[82] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[83] Oded Goldreich,et al. From absolute distinguishability to positive distinguishability , 2009, Electron. Colloquium Comput. Complex..
[84] Noga Alon,et al. Efficient Testing of Large Graphs , 2000, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[85] Jin-Yi Cai,et al. On the Hardness of Permanent , 1999, STACS.
[86] Errata to , 1980 .
[87] Martin Kassabov,et al. Symmetric groups and expander graphs , 2005 .
[88] Avishay Tal,et al. Matrix rigidity of random Toeplitz matrices , 2016, computational complexity.
[89] Ryan Williams,et al. Faster all-pairs shortest paths via circuit complexity , 2013, STOC.
[90] Leslie G. Valiant,et al. Exponential lower bounds for restricted monotone circuits , 1983, STOC.
[91] Oded Goldreich. On the Optimal Analysis of the Collision Probability Tester (an Exposition) , 2020, Computational Complexity and Property Testing.
[92] Avi Wigderson,et al. Monotone circuits for connectivity require super-logarithmic depth , 1990, STOC '88.
[93] Eli Ben-Sasson,et al. Some 3CNF properties are hard to test , 2003, STOC '03.
[94] Emanuele Viola,et al. Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two , 2006, STACS.
[95] A. Razborov. Lower bounds on the size of bounded depth circuits over a complete basis with logical addition , 1987 .
[96] Ronitt Rubinfeld,et al. Self-testing polynomial functions efficiently and over rational domains , 1992, SODA '92.
[97] Stasys Jukna,et al. Boolean Function Complexity Advances and Frontiers , 2012, Bull. EATCS.
[98] Jeffrey D. Smith,et al. Design and Analysis of Algorithms , 2012, Lecture Notes in Computer Science.
[99] László Babai,et al. Trading group theory for randomness , 1985, STOC '85.
[100] Seshadhri Comandur,et al. Testing Expansion in Bounded Degree Graphs , 2007, Electron. Colloquium Comput. Complex..
[101] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[102] Joan Feigenbaum,et al. On the random-self-reducibility of complete sets , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.
[103] Ueli Maurer,et al. Generalized privacy amplification , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.
[104] Oded Goldreich,et al. Introduction to Property Testing , 2017 .
[105] Moni Naor,et al. Does parallel repetition lower the error in computationally sound protocols? , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[106] Noga Alon,et al. Nearly tight bounds for testing function isomorphism , 2011, SODA '11.
[107] Oded Goldreich,et al. Testing graphs in vertex-distribution-free models , 2019, Electron. Colloquium Comput. Complex..
[108] Avi Wigderson,et al. Uniform direct product theorems: simplified, optimized, and derandomized , 2008, SIAM J. Comput..
[109] Noga Alon,et al. A characterization of the (natural) graph properties testable with one-sided error , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[110] Avishay Tal,et al. On Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions , 2017, Electron. Colloquium Comput. Complex..
[111] Miklós Ajtai,et al. ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..
[112] Ronitt Rubinfeld,et al. The Cover Time of a Regular Expander is O(n log n) , 1990, Information Processing Letters.
[113] Silvio Micali,et al. Non-Interactive Zero-Knowledge Proof Systems , 1987, CRYPTO.
[114] Noam Nisan,et al. Hardness vs Randomness , 1994, J. Comput. Syst. Sci..
[115] Richard E. Overill,et al. Foundations of Cryptography: Basic Tools , 2002, J. Log. Comput..
[116] A. Yao. Separating the polynomial-time hierarchy by oracles , 1985 .
[117] Richard J. Lipton,et al. New Directions In Testing , 1989, Distributed Computing And Cryptography.
[118] Emanuele Viola,et al. Hardness amplification proofs require majority , 2008, SIAM J. Comput..
[119] Umesh V. Vazirani,et al. Efficiency considerations in using semi-random sources , 1987, STOC.
[120] Satyanarayana V. Lokam. Complexity Lower Bounds using Linear Algebra , 2009, Found. Trends Theor. Comput. Sci..
[121] Johan Håstad,et al. Almost optimal lower bounds for small depth circuits , 1986, STOC '86.
[122] Joshua Brody,et al. Property Testing Lower Bounds via Communication Complexity , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.
[123] Guy Kindler,et al. Testing juntas , 2002, J. Comput. Syst. Sci..
[124] Shafi Goldwasser,et al. Private coins versus public coins in interactive proof systems , 1986, STOC '86.
[125] Moni Naor,et al. Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.
[126] Ilias Diakonikolas,et al. Collision-based Testers are Optimal for Uniformity and Closeness , 2016, Electron. Colloquium Comput. Complex..
[127] Anna R. Karlin,et al. Bounds on the cover time , 1989 .
[128] Eli Ben-Sasson,et al. Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding , 2004, SIAM J. Comput..
[129] Noga Alon,et al. The space complexity of approximating the frequency moments , 1996, STOC '96.
[130] László Babai. Random Oracles Separate PSPACE from the Polynomial-Time Hierarchy , 1987, Inf. Process. Lett..
[131] Oded Goldreich,et al. A Note on Computational Indistinguishability , 1990, Inf. Process. Lett..
[132] Oded Goldreich,et al. Computational complexity: a conceptual perspective , 2008, SIGA.
[133] Johan Håstad,et al. On Average Time Hierarchies , 1994, Inf. Process. Lett..
[134] Rafael Pass,et al. New and improved constructions of non-malleable cryptographic protocols , 2005, STOC '05.
[135] Avi Wigderson,et al. Derandomization that is rarely wrong from short advice that is typically good , 2002, Electron. Colloquium Comput. Complex..
[136] Leslie G. Valiant,et al. Graph-Theoretic Arguments in Low-Level Complexity , 1977, MFCS.
[137] Amit Sahai,et al. A complete promise problem for statistical zero-knowledge , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[138] Elchanan Mossel,et al. On ε‐biased generators in NC0 , 2006, Random Struct. Algorithms.
[139] Gregory Valiant,et al. A CLT and tight lower bounds for estimating entropy , 2010, Electron. Colloquium Comput. Complex..
[140] A. D. Wyner,et al. The wire-tap channel , 1975, The Bell System Technical Journal.
[141] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[142] Sofya Raskhodnikova,et al. Lower Bounds for Testing Properties of Functions over Hypergrid Domains , 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).
[143] Noga Alon,et al. A separation theorem in property testing , 2008, Comb..
[144] Oded Goldreich,et al. Short Locally Testable Codes and Proofs: A Survey in Two Parts , 2010, Property Testing.
[145] Emanuele Viola,et al. Local Expanders , 2017, computational complexity.
[146] László Babai,et al. Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes , 1988, J. Comput. Syst. Sci..
[147] Gregory Valiant,et al. Instance optimal learning of discrete distributions , 2016, STOC.
[148] Michael Sipser,et al. Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[149] Oded Goldreich,et al. RSA and Rabin Functions: Certain Parts are as Hard as the Whole , 1988, SIAM J. Comput..
[150] Boaz Barak. A Probabilistic-Time Hierarchy Theorem for "Slightly Non-uniform" Algorithms , 2002, RANDOM.
[151] Ueli Maurer. Perfect cryptographic security from partially independent channels , 1991, STOC '91.
[152] Avi Wigderson,et al. Randomness vs Time: Derandomization under a Uniform Assumption , 2001, J. Comput. Syst. Sci..
[153] Irit Dinur,et al. The PCP theorem by gap amplification , 2006, STOC.
[154] Virginia Vassilevska Williams,et al. Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk) , 2015, IPEC.
[155] Rafael Pass,et al. Concurrent non-malleable commitments , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[156] Sang Joon Kim,et al. A Mathematical Theory of Communication , 2006 .
[157] Luca Trevisan,et al. Pseudorandom generators without the XOR Lemma , 1999, Electron. Colloquium Comput. Complex..
[158] Dana Ron,et al. On the Relation Between the Relative Earth Mover Distance and the Variation Distance (an Exposition) , 2020, Computational Complexity and Property Testing.
[159] John Wright,et al. A Primer on the Statistics of Longest Increasing Subsequences and Quantum States , 2017 .
[160] Ronitt Rubinfeld,et al. Testing random variables for independence and identity , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[161] Manuel Blum,et al. How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[162] Jørn Justesen,et al. Class of constructive asymptotically good algebraic codes , 1972, IEEE Trans. Inf. Theory.
[163] Luca Trevisan,et al. Three Theorems regarding Testing Graph Properties , 2001, Electron. Colloquium Comput. Complex..
[164] Dana Ron,et al. Improved Testing Algorithms for Monotonicity , 1999, Electron. Colloquium Comput. Complex..
[165] Boaz Barak,et al. Non-black-box Techniques in Cryptography , 2006, CSR.
[166] Leslie G. Valiant,et al. Short Monotone Formulae for the Majority Function , 1984, J. Algorithms.
[167] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.
[168] Yuval Ishai,et al. Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems , 2005, CRYPTO.
[169] Gregory Valiant,et al. Instance Optimal Learning , 2015, ArXiv.
[170] Ran Raz,et al. Lower Bounds and Separations for Constant Depth Multilinear Circuits , 2008, Computational Complexity Conference.