Optimization of the parallel Gottfert algorithm - by Lama Bahaa Tamim
Abstract
Our project presents an optimization of the linear communication model in the BS P variant of the Gottfert. The parallel Gottfert algorithm has been shown to be highly scalable in factorizing large polynomials over finite fields F2. Our pro posed optimiza
Description
Project (M.S.)--American University of Beirut, Dept. of Computer Science, 2008.;"Advisor : Dr. Fatima Abu Salem, Assitant Professor , Computer Science--Member of Committee : Dr. Paul Atie, Associate Professor , Computer Science"
Bibliography : leaf 35.
Bibliography : leaf 35.