Abstract
A heuristic factorization scheme that uses learning and other heuristic programming techniques to improve the efficiency of determining the symbolic factorization of multivariate polynomials with integer coefficients and an arbitrary number of variables and terms is described. The learning program, POLYFACT, in which the factorization scheme is implemented is also described. POLYFACT uses learning through the dynamic construction and manipulation of first-order predicate calculus heuristics to reduce the amount of searching for the irreducible factors of a polynomial. Tables containing the results of factoring randomly generated multivariate polynomials are presented: (1) to demonstrate that learning does improve considerably the efficiency of factoring polynomials, and (2) to show that POLYFACT does learn from previous experience. The factorization times of polynomials factored by both the scheme implemented in POLYFACT and Wang's implementation of Berlekamp's algorithm are given. The two algorithms are compared, and two situations where POLYFACT'S algorithm can be used to improve the efficiency of Wang's algorithm are discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
