Author:  
All :: A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z 
All :: S. Dolado, ... , Shlosman, Shparlinski, Shvarts, ... , Székelyhidi 
References
9.
Marek Karpinski, László Mérai and Igor E. Shparlinski
Identity testing and interpolation from high powers of polynomials of large degree over finite fields
J. Complexity, 49:74--84
2018
8.
Gábor Ivanyos, Marek Karpinski, Miklos Santha, Nitin Saxena and Igor E. Shparlinski
Polynomial interpolation and identity testing from high powers over finite fields
Algorithmica, 80(2):560--575
2018
7.
Gábor Ivanyos, Marek Karpinski, Miklos Santha, Nitin Saxena and Igor E. Shparlinski
Polynomial interpolation and identity testing from high powers over finite fields
Algorithmica, 80(2):560--575
2018
6.
Gábor Ivanyos, Marek Karpinski, Miklos Santha, Nitin Saxena and Igor E. Shparlinski
Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields
Algorithmica,
2017
5.
Gábor Ivanyos, Marek Karpinski, Miklos Santha, Nitin Saxena and Igor E. Shparlinski
Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields
Algorithmica,
2017
4.
Marek Karpinski, Alf van der Poorten and Igor Shparlinski
Zero testing of p-adic and modular polynomials
Theoret. Comput. Sci., 233(1-2):309--317
2000
3.
Marek Karpinski and Igor Shparlinski
On the computational hardness of testing square-freeness of sparse polynomials
Applied algebra, algebraic algorithms and error-correcting codes (Honolulu, HI, 1999) Volume 1719 of Lecture Notes in Comput. Sci.
page 492--497.
Publisher: Springer, Berlin,
1999
2.
Joachim von zur Gathen, Marek Karpinski and Igor Shparlinski
Counting curves and their projections
Comput. Complexity, 6(1):64--99
1996
1.
Marek Karpinski and Igor Shparlinski
On some approximation problems concerning sparse polynomials over finite fields
Theoret. Comput. Sci., 157(2):259--266
1996
Export as:
BibTeX, XML