-
1
-
-
79959733663
-
From affine to two-source extractors via approximate duality
-
New York, NY, USA, ACM
-
E. Ben-Sasson and N. Zewi. From affine to two-source extractors via approximate duality. In Proceedings of the 43rd annual ACM symposium on Theory of computing, STOC '11, pages 177-186, New York, NY, USA, 2011. ACM.
-
(2011)
Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, STOC '11
, pp. 177-186
-
-
Ben-Sasson, E.1
Zewi, N.2
-
2
-
-
0000167385
-
Solving zero-dimensional algebraic systems
-
D. and Lazard. Solving zero-dimensional algebraic systems. Journal of Symbolic Computation, 13(2):117-131, 1992.
-
(1992)
Journal of Symbolic Computation
, vol.13
, Issue.2
, pp. 117-131
-
-
Lazard, D.1
-
3
-
-
25944479355
-
Efficient computation of zero-dimensional gröbner bases by change of ordering
-
October
-
J. C. Faugère, P. Gianni, D. Lazard, and T. Mora. Efficient computation of zero-dimensional gröbner bases by change of ordering. J. Symb. Comput., 16:329-344, October 1993.
-
(1993)
J. Symb. Comput.
, vol.16
, pp. 329-344
-
-
Faugère, J.C.1
Gianni, P.2
Lazard, D.3
Mora, T.4
-
4
-
-
80052004403
-
Linear-algebraic list decoding of folded reed-solomon codes
-
V. Guruswami. Linear-algebraic list decoding of folded reed-solomon codes. In IEEE Conference on Computational Complexity, pages 77-85, 2011.
-
(2011)
IEEE Conference on Computational Complexity
, pp. 77-85
-
-
Guruswami, V.1
-
5
-
-
38349146703
-
Explicit codes achieving list decoding capacity: Error-correction with optimal redundancy
-
V. Guruswami and A. Rudra. Explicit codes achieving list decoding capacity: Error-correction with optimal redundancy. Information Theory, IEEE Transactions on, 54(1):135 -150, 2008.
-
(2008)
Information Theory, IEEE Transactions on
, vol.54
, Issue.1
, pp. 135-150
-
-
Guruswami, V.1
Rudra, A.2
-
6
-
-
80052389088
-
Optimal rate list decoding via derivative codes
-
V. Guruswami and C. Wang. Optimal rate list decoding via derivative codes. In APPROX-RANDOM, pages 593-604, 2011.
-
(2011)
APPROX-RANDOM
, pp. 593-604
-
-
Guruswami, V.1
Wang, C.2
-
7
-
-
79959688264
-
High-rate codes with sublinear-time decoding
-
New York, NY, USA, ACM
-
S. Kopparty, S. Saraf, and S. Yekhanin. High-rate codes with sublinear-time decoding. In Proceedings of the 43rd annual ACM symposium on Theory of computing, STOC '11, pages 167-176, New York, NY, USA, 2011. ACM.
-
(2011)
Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, STOC '11
, pp. 167-176
-
-
Kopparty, S.1
Saraf, S.2
Yekhanin, S.3
-
8
-
-
33750330247
-
Pseudorandom sets and explicit construction of Ramsey graphs
-
P. Pudlák and V. Rödl. Pseudorandom sets and explicit construction of Ramsey graphs. Quaderni di Matematica, 13:327-346, 2004.
-
(2004)
Quaderni di Matematica
, vol.13
, pp. 327-346
-
-
Pudlák, P.1
Rödl, V.2
-
9
-
-
51249166721
-
On the affine bezout inequality
-
J. Schmid. On the affine bezout inequality. Manuscripta Mathematica, 88(1):225-232, 1995.
-
(1995)
Manuscripta Mathematica
, vol.88
, Issue.1
, pp. 225-232
-
-
Schmid, J.1
|