On some approximation problems concerning sparse polynomials over finite fields

Author： Karpinski M.   Shparlinski I.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.157, Iss.2, 1996-05, pp. : 259-266

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The undecidability of some equivalence problems concerning ngsm's and finite substitutions

By Turakainen P.  

Theoretical Computer Science, Vol. 174, Iss. 1, 1997-03 ,pp. : 269-274

Elsevier

Access to resources Recommend Favorite

Approximation of some NP-hard optimization problems by finite machines, in probability

By Hong D.   Birget  

Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. : 323-339

Elsevier

Access to resources Recommend Favorite

Differential approximation algorithms for some combinatorial optimization problems

By Demange M.   Grisoni P.   Th. Paschos V.  

Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. : 107-122

Elsevier

Access to resources Recommend Favorite

Univariate polynomial factorization over finite fields

By Naudin P.   Quitte C.  

Theoretical Computer Science, Vol. 191, Iss. 1, 1998-01 ,pp. : 1-36

Elsevier

Access to resources Recommend Favorite

On square-free factorization of multivariate polynomials over a finite field

By Bernardin L.  

Theoretical Computer Science, Vol. 187, Iss. 1, 1997-11 ,pp. : 105-116

Elsevier

Access to resources Recommend Favorite