Noisy interpolation of sparse polynomials in finite fields

Applicable Algebra in Engineering Communication and Computing ◽

10.1007/s00200-005-0180-1 ◽

2005 ◽

Vol 16 (5) ◽

pp. 307-317 ◽

Author(s):

Igor Shparlinski ◽

Arne Winterhof

Keyword(s):

Finite Fields ◽

Sparse Polynomials

Download Full-text

Sparse polynomials, redundant bases, gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields

Designs Codes and Cryptography ◽

10.1007/s10623-006-9016-7 ◽

2006 ◽

Vol 41 (3) ◽

pp. 299-306

Author(s):

Soonhak Kwon ◽

Chang Hoon Kim ◽

Chun Pyo Hong

Keyword(s):

Finite Fields ◽

Primitive Elements ◽

Sparse Polynomials ◽

Download Full-text

Exponential Sums with Sparse Polynomials over Finite Fields

SIAM Journal on Discrete Mathematics ◽

10.1137/20m1357731 ◽

2021 ◽

Vol 35 (2) ◽

pp. 976-987

Author(s):

Igor E. Shparlinski ◽

Qiang Wang

Keyword(s):

Finite Fields ◽

Exponential Sums ◽

Sparse Polynomials ◽

Polynomials Over Finite Fields

Download Full-text

Noisy Interpolation of Multivariate Sparse Polynomials in Finite Fields

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - Lecture Notes in Computer Science ◽

10.1007/978-3-642-02181-7_18 ◽

2009 ◽

pp. 169-178

Author(s):

Álvar Ibeas ◽

Arne Winterhof

Keyword(s):

Finite Fields ◽

Sparse Polynomials

Download Full-text

Hitting Set Generators for Sparse Polynomials over Any Finite Fields

2012 IEEE 27th Conference on Computational Complexity ◽

10.1109/ccc.2012.20 ◽

2012 ◽

Author(s):

Chi-Jen Lu

Keyword(s):

Finite Fields ◽

Hitting Set ◽

Sparse Polynomials

Download Full-text

Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation - ISSAC '13 ◽

10.1145/2465506.2465514 ◽

2013 ◽

Author(s):

Jingguo Bi ◽

Qi Cheng ◽

J. Maurice Rojas

Keyword(s):

Finite Fields ◽

Sparse Polynomials ◽

Root Detection ◽

Polynomials Over Finite Fields

Download Full-text

Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields

SIAM Journal on Computing ◽

10.1137/140990401 ◽

2016 ◽

Vol 45 (4) ◽

pp. 1433-1447 ◽

Author(s):

Jingguo Bi ◽

Qi Cheng ◽

J. Maurice Rojas

Keyword(s):

Finite Fields ◽

Sparse Polynomials ◽

Root Detection ◽

Polynomials Over Finite Fields

Download Full-text

On some approximation problems concerning sparse polynomials over finite fields

Theoretical Computer Science ◽

10.1016/0304-3975(95)00162-x ◽

1996 ◽

Vol 157 (2) ◽

pp. 259-266 ◽

Author(s):

Marek Karpinski ◽

Igor Shparlinski

Keyword(s):

Finite Fields ◽

Sparse Polynomials ◽

Polynomials Over Finite Fields ◽

Approximation Problems

Download Full-text

Finite Fields

10.1017/cbo9780511525926 ◽

1996 ◽

Author(s):

Rudolf Lidl ◽

Harald Niederreiter

Keyword(s):

Download Full-text

Finite Fields and Applications

10.1017/cbo9780511525988 ◽

1996 ◽

Keyword(s):

Download Full-text

Algebraic Curves over Finite Fields

10.1017/cbo9780511608766 ◽

1991 ◽

Author(s):

Carlos Moreno

Keyword(s):

Finite Fields ◽

Algebraic Curves ◽

Curves Over Finite Fields

Download Full-text