EFFICIENT ALGORITHMS FOR COMPUTATIONS WITH SPARSE POLYNOMIALS

@inproceedings{Mohammad2011EFFICIENTAF,
  title={EFFICIENT ALGORITHMS FOR COMPUTATIONS WITH SPARSE POLYNOMIALS},
  author={Seyed Froutan Mohammad and Mahdi Moshref Javadi},
  year={2011}
}
The problem of interpolating a sparse polynomial has always been one of the central objects of research in the area of computer algebra. It is the key part of many algorithms such as polynomial GCD computation. We present a probabilistic algorithm to interpolate a sparse multivariate polynomial over a finite field, represented with a black box. Our algorithm modifies the Ben-Or/Tiwari algorithm from 1988 for interpolating polynomials over rings with characteristic zero to positive… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 74 REFERENCES

Similar Papers

Loading similar papers…