Derandomizing homomorphism testing in general groups
暂无分享,去创建一个
[1] Noga Alon,et al. epsilon-Discrepancy Sets and Their Application for Interpolation of Sparse Polynomials , 1995, Inf. Process. Lett..
[2] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..
[3] Noga Alon,et al. Random Cayley Graphs and Expanders , 1994, Random Struct. Algorithms.
[4] 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).
[5] Z. Galil,et al. Explicit constructions of linear size superconcentrators , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[6] Mihir Bellare,et al. Linearity testing in characteristic two , 1996, IEEE Trans. Inf. Theory.
[7] Alexander Lubotzky,et al. Discrete groups, expanding graphs and invariant measures , 1994, Progress in mathematics.
[8] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[9] Noam Nisan,et al. Velickovic approximations of general independent distributions , 1992, Symposium on the Theory of Computing.
[10] Yishay MansouryJanuary. "-discrepancy Sets and Their Applications for Interpolation of Sparse Polynomials , 1995 .
[11] N. Katz. An estimate for character sums , 1989 .
[12] Mihir Bellare,et al. Improved non-approximability results , 1994, STOC '94.
[13] Carsten Lund,et al. Efficient probabilistic checkable proofs and applications to approximation , 1994, STOC '94.
[14] Abhiram G. Ranade. Combinatorial Property Testing , 2006 .
[15] Eli Ben-Sasson,et al. Randomness-efficient low degree tests and short PCPs via epsilon-biased sets , 2003, STOC '03.
[16] R. Impagliazzo,et al. P=BPP unless E has sub-exponential circuits: Derandomizing the XOR Lemma , 2002 .
[17] Noga Alon,et al. Simple Construction of Almost k-wise Independent Random Variables , 1992, Random Struct. Algorithms.
[18] Noga Alon,et al. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.
[19] Avi Wigderson,et al. Simple analysis of graph tests for linearity and PCP , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.
[20] F. Chung. Diameters and eigenvalues , 1989 .
[21] Luca Trevisan,et al. A PCP characterization of NP with optimal amortized query complexity , 2000, STOC '00.
[22] Carsten Lund,et al. Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.
[23] Moni Naor,et al. Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.
[24] N. S. Barnett,et al. Private communication , 1969 .
[25] Noga Alon,et al. Explicit construction of linear sized tolerant networks , 1988, Discret. Math..
[26] 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.
[27] Mihir Bellare,et al. Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[28] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[29] M. Murty. Ramanujan Graphs , 1965 .
[30] Avi Wigderson,et al. P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.
[31] Noam Nisan,et al. Approximations of general independent distributions , 1992, STOC '92.
[32] Oded Goldreich,et al. Locally testable codes and PCPs of almost-linear length , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[33] Oded Goldreich,et al. On the power of two-point based sampling , 1989, J. Complex..
[34] Noga Alon,et al. Eigenvalues, Expanders and Superconcentrators (Extended Abstract) , 1984, FOCS.
[35] Avi Wigderson,et al. Simple analysis of graph tests for linearity and PCP , 2003, Random Struct. Algorithms.
[36] GoldreichOded,et al. Locally testable codes and PCPs of almost-linear length , 2006 .
[37] R. M. Tanner. Explicit Concentrators from Generalized N-Gons , 1984 .