Abstract
An algorithm which recovers a rational number from its image modulo a suitable prime or prime power is used in the p-adic lifting stage of univariate polynomial factorization to detect the formation of true factors. Such detections are usually made long before the modulus reaches the coefficient bound. The early removal of factors results in a reduced lifting problem and a lower coefficient bound. Algorithms are specified. Actual computer timing data are included.
Sign-in/Register to access full text options 
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.
