Optimization of the parallel Gottfert algorithm - by Lama Bahaa Tamim

dc.contributor.authorTamim, Lama Bahaa
dc.contributor.departmentAmerican University of Beirut. Faculty of Arts and Sciences. Department of Computer Science
dc.date2008
dc.date.accessioned2012-06-13T07:14:26Z
dc.date.available2012-06-13T07:14:26Z
dc.date.issued2008
dc.descriptionProject (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"
dc.descriptionBibliography : leaf 35.
dc.description.abstractOur 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
dc.format.extentvii, 35 leaves : col. ill. 30 cm.
dc.identifier.urihttp://hdl.handle.net/10938/7840
dc.language.isoen
dc.relation.ispartofTheses, Dissertations, and Projects
dc.subject.classificationPj:001477 AUBNO
dc.subject.lcshMathematical optimization -- Software
dc.titleOptimization of the parallel Gottfert algorithm - by Lama Bahaa Tamim
dc.typeProject

Files