@article{Moenck:1976aa,
    Abstract = {The current proposals for applying the so called ``fast''O(N logaN) algorithms to multivariate polynomials is that the univariate methods be applied recursively, much in the way more conventional algorithms are used. Since the size of the problems is rather large for which a ``fastrd algorithm is more efficient than a classical one, the recursive approach compounds this size completely out of any practical range''.},
    Author = {Moenck, Robert T.},
    Date = {1976/06/01},
    File = {Another Polynomial Homomorphism - moenck1976 - a.pdf},
    ISBN = {1432-0525},
    Journal = {Acta Informatica},
    Number = {2},
    Pages = {153--169},
    Title = {Another polynomial homomorphism},
    URL = {https://doi.org/10.1007/BF00268498},
    Volume = {6},
    Year = {1976},
    bdsk-url-1 = {https://doi.org/10.1007/BF00268498},
    date-added = {2023-02-02 22:30:57 +0100},
    date-modified = {2023-02-02 22:30:58 +0100},
    id = {Moenck1976},
    doi = {10.1007/BF00268498}
}

@article{Moenck:1976aa, Abstract = {The current proposals for applying the so called fast''O(N logaN) algorithms to multivariate polynomials is that the univariate methods be applied recursively, much in the way more conventional algorithms are used. Since the size of the problems is rather large for which afastrd algorithm is more efficient than a classical one, the recursive approach compounds this size completely out of any practical range''.}, Author = {Moenck, Robert T.}, Date = {1976/06/01}, File = {Another Polynomial Homomorphism - moenck1976 - a.pdf}, ISBN = {1432-0525}, Journal = {Acta Informatica}, Number = {2}, Pages = {153--169}, Title = {Another polynomial homomorphism}, URL = {https://doi.org/10.1007/BF00268498}, Volume = {6}, Year = {1976}, bdsk-url-1 = {https://doi.org/10.1007/BF00268498}, date-added = {2023-02-02 22:30:57 +0100}, date-modified = {2023-02-02 22:30:58 +0100}, id = {Moenck1976}, doi = {10.1007/BF00268498} }