@inproceedings{10.1007/3-540-09519-5_73,
    Abstract = {In this paper we have tried to demonstrate how sparse techniques can be used to increase the effectiveness of the modular algorithms of Brown and Collins. These techniques can be used for an extremely wide class of problems and can applied to a number of different algorithms including Hensel's lemma. We believe this work has finally laid to rest the bad zero problem.},
    Address = {Berlin, Heidelberg},
    Author = {Zippel, Richard},
    BookTitle = {Symbolic and Algebraic Computation},
    Editor = {Ng, Edward W.},
    File = {Probabilistic algorithms for sparse polynomials - zippel1979.pdf},
    ISBN = {978-3-540-35128-3},
    Pages = {216--226},
    Publisher = {Springer Berlin Heidelberg},
    Title = {Probabilistic algorithms for sparse polynomials},
    Year = {1979},
    date-added = {2023-10-02 11:29:00 +0200},
    date-modified = {2023-10-02 11:29:00 +0200},
    doi = {10.1007/3-540-09519-5_73}
}

@inproceedings{10.1007/3-540-09519-5_73, Abstract = {In this paper we have tried to demonstrate how sparse techniques can be used to increase the effectiveness of the modular algorithms of Brown and Collins. These techniques can be used for an extremely wide class of problems and can applied to a number of different algorithms including Hensel's lemma. We believe this work has finally laid to rest the bad zero problem.}, Address = {Berlin, Heidelberg}, Author = {Zippel, Richard}, BookTitle = {Symbolic and Algebraic Computation}, Editor = {Ng, Edward W.}, File = {Probabilistic algorithms for sparse polynomials - zippel1979.pdf}, ISBN = {978-3-540-35128-3}, Pages = {216--226}, Publisher = {Springer Berlin Heidelberg}, Title = {Probabilistic algorithms for sparse polynomials}, Year = {1979}, date-added = {2023-10-02 11:29:00 +0200}, date-modified = {2023-10-02 11:29:00 +0200}, doi = {10.1007/3-540-09519-5_73} }