Pseudorandom generators for combinatorial checkerboards
暂无分享,去创建一个
[1] Emanuele Viola. Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates , 2007, SIAM J. Comput..
[2] 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.
[3] Andrej Bogdanov. Pseudorandom generators for low degree polynomials , 2005, STOC '05.
[4] Michael E. Saks,et al. Discrepancy sets and pseudorandom generators for combinatorial rectangles , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[5] Emanuele Viola,et al. Pseudorandom Bits for Polynomials , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[6] Michael Luby,et al. On deterministic approximation of DNF , 2005, Algorithmica.
[7] P. Gopalan,et al. Fooling Functions of Halfspaces under Product Distributions , 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.
[8] Dieter van Melkebeek,et al. On Circuit Lower Bounds from Derandomization , 2011, Theory Comput..
[9] Noam Nisan,et al. Pseudorandom generators for space-bounded computation , 1992, Comb..
[10] Mihir Bellare,et al. Randomness-efficient oblivious sampling , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[11] Joshua Brody,et al. The Coin Problem and Pseudorandomness for Branching Programs , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[12] Luca Trevisan,et al. A Note on Approximate Counting for k-DNF , 2004, APPROX-RANDOM.
[13] Chi-Jen Lu,et al. Improved Pseudorandom Generators for Combinatorial Rectangles , 1998, Comb..
[14] Noam Nisan,et al. BPP has subexponential time simulations unless EXPTIME has publishable proofs , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.
[15] Christopher Umans,et al. Pseudo-random generators for all hardnesses , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[16] Akira Maruoka,et al. Expanders obtained from affine transformations , 1985, STOC '85.
[17] Pavel Pudlák,et al. Pseudorandom Generators for Group Products , 2010, Electron. Colloquium Comput. Complex..
[18] Daniel M. Kane,et al. Bounded Independence Fools Degree-2 Threshold Functions , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[19] Oded Goldreich,et al. Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing (Preliminary Version) , 1997, STOC 1994.
[20] Roy Armoni,et al. On the Derandomization of Space-Bounded Computations , 1998, RANDOM.
[21] Endre Szemerédi,et al. Undirected Connectivity in O(l~gl*~ n) Space* , 1992 .
[22] Michael Saks,et al. BP H SPACE(S)⊆DSPACE(S 3/2 ) , 1999, FOCS 1999.
[23] David Zuckerman,et al. Small-Bias Spaces for Group Products , 2009, APPROX-RANDOM.
[24] Oded Goldreich,et al. Efficient approximation of product distributions , 1998 .
[25] Zvi Galil,et al. Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..
[26] Avi Wigderson,et al. Deterministic approximate counting of depth-2 circuits , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.
[27] Prahladh Harsha,et al. An invariance principle for polytopes , 2009, JACM.
[28] Anindya De,et al. Pseudorandomness for Permutation and Regular Branching Programs , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.
[29] Omer Reingold,et al. Undirected connectivity in log-space , 2008, JACM.
[30] Jin-Yi Cai,et al. Time-Space Tradeoff in Derandomizing Probabilistic Logspace , 2004, STACS.
[31] Noga Alon,et al. Simple Construction of Almost k-wise Independent Random Variables , 1992, Random Struct. Algorithms.
[32] Shachar Lovett,et al. Pseudorandom Generators for CC0[p] and the Fourier Spectrum of Low-Degree Polynomials over Finite Fields , 2010, FOCS.
[33] Elchanan Mossel,et al. On ε‐biased generators in NC0 , 2006, Random Struct. Algorithms.
[34] Shachar Lovett,et al. Pseudorandom generators for CC 0 [p] and the Fourier spectrum of low-degree polynomials over finite fields. , 2010 .
[35] Mark Braverman,et al. Poly-logarithmic Independence Fools AC^0 Circuits , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.
[36] Lance Fortnow,et al. Linear Advice for Randomized Logarithmic Space , 2006, STACS.
[37] Alexander A. Razborov. A Simple Proof of Bazzi’s Theorem , 2009, TOCT.
[38] Noam Nisan,et al. RL⊆SC , 1992, STOC '92.
[39] Dieter van Melkebeek,et al. A note on circuit lower bounds from derandomization , 2010, Electron. Colloquium Comput. Complex..
[40] Avi Wigderson,et al. Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[41] Avi Wigderson,et al. Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing , 1997, Electron. Colloquium Comput. Complex..
[42] Noam Nisan,et al. Pseudorandom bits for constant depth circuits , 1991, Comb..
[43] Noam Nisan,et al. Pseudorandomness for network algorithms , 1994, STOC '94.
[44] Moni Naor,et al. Small-Bias Probability Spaces: Efficient Constructions and Applications , 1993, SIAM J. Comput..
[45] Louay Bazzi,et al. Polylogarithmic Independence Can Fool DNF Formulas , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[46] Luca Trevisan,et al. On epsilon-Biased Generators in NC0 , 2003, Electron. Colloquium Comput. Complex..
[47] Russell Impagliazzo,et al. Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds , 2003, STOC '03.
[48] Emanuele Viola. The Sum of d Small-Bias Generators Fools Polynomials of Degree d , 2008, Computational Complexity Conference.
[49] Periklis A. Papakonstantinou,et al. Pseudorandomness for Read-Once Formulas , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[50] Luca Trevisan,et al. Pseudorandom generators without the XOR lemma , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).
[51] Salil P. Vadhan,et al. Derandomized Squaring of Graphs , 2005, APPROX-RANDOM.
[52] David Zuckerman,et al. Pseudorandom generators for polynomial threshold functions , 2009, STOC '10.
[53] Avi Wigderson,et al. P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.
[54] A. Wigderson,et al. ENTROPY WAVES, THE ZIG-ZAG GRAPH PRODUCT, AND NEW CONSTANT-DEGREE , 2004, math/0406038.
[55] Noam Nisan,et al. Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs , 1992, J. Comput. Syst. Sci..
[56] Noam Nisan. Rl <= Sc , 1994, Comput. Complex..
[57] Luca Trevisan,et al. Pseudorandom walks on regular digraphs and the RL vs. L problem , 2006, STOC '06.
[58] Madhur Tulsiani,et al. Improved Pseudorandom Generators for Depth 2 Circuits , 2010, APPROX-RANDOM.
[59] Noam Nisan,et al. Hardness vs. randomness , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[60] Stanislav Zák,et al. A Polynomial Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3 , 2010, Electron. Colloquium Comput. Complex..
[61] Ran Raz,et al. On recycling the randomness of states in space bounded computation , 1999, STOC '99.
[62] Shachar Lovett. Unconditional Pseudorandom Generators for Low Degree Polynomials , 2009, Theory Comput..
[63] Ta-ShmaAmnon,et al. An O(log(n)4/3) space algorithm for (s, t) connectivity in undirected graphs , 2000 .
[64] Avi Wigderson,et al. Reducing The Seed Length In The Nisan-Wigderson Generator* , 2006, Comb..
[65] M. Murty. Ramanujan Graphs , 1965 .
[66] Akira Maruoka,et al. Expanders obtained from affine transformations , 1987, Comb..
[67] Michael E. Saks,et al. Efficient construction of a small hitting set for combinatorial rectangles in high dimension , 1993, Comb..
[68] Noga Alon,et al. Explicit construction of linear sized tolerant networks , 1988, Discret. Math..
[69] Lance Fortnow,et al. BPP has subexponential time simulations unlessEXPTIME has publishable proofs , 2005, computational complexity.
[70] Christopher Umans,et al. Simple extractors for all min-entropies and a new pseudorandom generator , 2005, JACM.
[71] Avi Wigderson,et al. Deterministic simulation of probabilistic constant depth circuits , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[72] Noam Nisan,et al. On read-once vs. multiple access to randomness in logspace , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.
[73] Noga Alon,et al. lambda1, Isoperimetric inequalities for graphs, and superconcentrators , 1985, J. Comb. Theory, Ser. B.
[74] Omer Reingold,et al. Pseudorandom generators for combinatorial shapes , 2011, STOC '11.
[75] E. Szemerédi,et al. Undirected connectivity in O(log/sup 1.5/n) space , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[76] Adam R. Klivans. On the Derandomization of Constant Depth Circuits , 2001, RANDOM-APPROX.
[77] Avi Wigderson,et al. In search of an easy witness: exponential time vs. probabilistic polynomial time , 2002, J. Comput. Syst. Sci..
[78] Shachar Lovett,et al. Pseudorandom Bit Generators That Fool Modular Sums , 2009, APPROX-RANDOM.
[79] Emanuele Viola,et al. Pseudorandom Bits for Polynomials , 2010, SIAM J. Comput..
[80] Noam Nisan. On Read-Once vs. Multiple Access to Randomness in Logspace , 1993, Theor. Comput. Sci..
[81] Russell Impagliazzo,et al. Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds , 2003, STOC '03.
[82] Avi Wigderson,et al. An O(log(n)4/3) space algorithm for (s, t) connectivity in undirected graphs , 2000, JACM.
[83] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[84] Oded Goldreich,et al. In a World of P=BPP , 2010, Studies in Complexity and Cryptography.
[85] Rocco A. Servedio,et al. Bounded Independence Fools Halfspaces , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[86] Noga Alon,et al. Better Expanders and Superconcentrators , 1987, J. Algorithms.
[87] BPHSPACE ( S ) DSPACE ( S 3 2 ) * , 1999 .
[88] Noam Nisan,et al. Randomness is Linear in Space , 1996, J. Comput. Syst. Sci..
[89] Moshe Morgenstern,et al. Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power q , 1994, J. Comb. Theory, Ser. B.
[90] János Komlós,et al. Deterministic simulation in LOGSPACE , 1987, STOC.
[91] Zeev Dvir,et al. Pseudorandomness for Width-2 Branching Programs , 2013, Theory Comput..
[92] Ran Raz,et al. Pseudorandom Generators for Regular Branching Programs , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[93] N. Alon,et al. il , , lsoperimetric Inequalities for Graphs , and Superconcentrators , 1985 .
[94] Salil P. Vadhan,et al. Computational Complexity , 2005, Encyclopedia of Cryptography and Security.
[95] Shachar Lovett,et al. Unconditional pseudorandom generators for low degree polynomials , 2008, Theory Comput..
[96] Pavel Pudlák,et al. Pseudorandom generators for group products: extended abstract , 2011, STOC '11.