On Zeros of a Polynomial in a Finite Grid
暂无分享,去创建一个
Pete L. Clark | John R. Schmitt | Aditya Potukuchi | Anurag Bishnoi | P. L. Clark | A. Bishnoi | Aditya Potukuchi
[1] Noga Alon,et al. Colorings and orientations of graphs , 1992, Comb..
[2] C. Chevalley,et al. Démonstration d’une hypothèse de M. Artin , 1935 .
[3] P. L. Clark. Fattening up Warning's Second Theorem , 2015, 1506.06743.
[4] A. Blokhuis,et al. Blocking sets in projective spaces , 2012 .
[5] A. Hurwitz. Über höhere Kongruenzen: Archiv der Mathematik und Physik, III. Reihe, Bd. 5, 1903, S. 17–27 , 1963 .
[6] Madhu Sudan,et al. Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers , 2013, SIAM J. Comput..
[7] Richard J. Lipton,et al. A Probabilistic Remark on Algebraic Program Testing , 1978, Inf. Process. Lett..
[8] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.
[9] ROBERT E. JAMISON,et al. Covering Finite Fields with Cosets of Subspaces , 1977, J. Comb. Theory, Ser. A.
[10] Olav Geil,et al. Weighted Reed–Muller codes revisited , 2011, Des. Codes Cryptogr..
[11] Oriol Serra,et al. Erratum to: Punctured Combinatorial Nullstellensätze , 2011, Comb..
[12] Cícero Carvalho,et al. On the second Hamming weight of some Reed-Muller type codes , 2013, Finite Fields Their Appl..
[13] Richard Zippel,et al. Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.
[14] J. H. van Lint,et al. Introduction to Coding Theory , 1982 .
[15] Jean-Marie Goethals,et al. On Generalized Reed-Muller Codes and Their Relatives , 1970, Inf. Control..
[16] Oriol Serra,et al. Punctured combinatorial Nullstellensätze , 2009, Comb..
[17] Jacobus H. van Lint,et al. Introduction to Coding Theory , 1982 .
[18] Andries E. Brouwer,et al. Blocking sets in desarguesian projective planes , 1986 .
[19] Herrn Chevalley,et al. Bemerkung zur vorstehenden Arbeit , 1935 .
[20] Uwe Schauz,et al. Algebraically Solvable Problems: Describing Polynomials as Equivalent to Explicit Solutions , 2008, Electron. J. Comb..
[21] Rafael H. Villarreal,et al. Affine cartesian codes , 2012, Designs, Codes and Cryptography.
[22] Olav Geil,et al. More results on the number of zeros of multiplicity at least r , 2017, Discret. Math..
[23] Pete L. Clark,et al. Covering Numbers in Linear Algebra , 2012, Am. Math. Mon..
[24] Alexander Schrijver,et al. The Blocking Number of an Affine Space , 1978, J. Comb. Theory, Ser. A.
[25] Pete L. Clark,et al. The Combinatorial Nullstellensätze Revisited , 2014, Electron. J. Comb..
[26] Pete L. Clark,et al. Warning’s Second Theorem with restricted variables , 2014, Comb..
[27] Klaus Metsch. How many s-subspaces must miss a point set in PG(d, q) , 2007 .
[28] Helmut Hasse. Theorie der höheren Differentiale in einem algebraischen Funktionenkörper mit vollkommenem Konstantenkörper bei beliebiger Charakteristik. , 1936 .
[29] Noga Alon,et al. Covering the Cube by Affine Hyperplanes , 1993, Eur. J. Comb..
[30] M. Ziegler. Volume 152 of Graduate Texts in Mathematics , 1995 .
[31] Irving S. Reed,et al. A class of multiple-error-correcting codes and the decoding scheme , 1954, Trans. IRE Prof. Group Inf. Theory.
[32] Olav Geil. On the second weight of generalized Reed-Muller codes , 2008, Des. Codes Cryptogr..
[33] David E. Muller,et al. Application of Boolean algebra to switching circuit design and to error detection , 1954, Trans. I R E Prof. Group Electron. Comput..
[34] Maheshanand Bhaintwal,et al. Generalized Reed-Muller codes over Z q . , 2010 .
[35] Geertrui Van de Voorde,et al. Partial covers of PG(n, q) , 2010, Eur. J. Comb..
[36] Richard Zippel,et al. An Explicit Separation of Relativised Random Polynomial Time and Relativised Deterministic Polynomial Time , 1989, Inf. Process. Lett..