Show simple item record

dc.contributor.authorPelz, Wolfgangen_US
dc.contributor.authorWatson, Layne T.en_US
dc.date.accessioned2013-06-19T14:36:04Z
dc.date.available2013-06-19T14:36:04Z
dc.date.issued1986
dc.identifierhttp://eprints.cs.vt.edu/archive/00000033/en_US
dc.identifier.urihttp://hdl.handle.net/10919/19819
dc.description.abstractComparisons between problems solved on uniprocessor systems and those solved on distributed computing systems generally ignore the overhead associated with information transfer from one process to another. This paper considers the solution of polynomial systems of equations via a globally convergent homotopy algorithm on a hypercube and some timing results for different situations.en_US
dc.format.mimetypeapplication/pdfen_US
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen_US
dc.relation.ispartofHistorical Collection(Till Dec 2001)en_US
dc.titleMessage Length Effects for Solving Polynomial Systems on a Hypercubeen_US
dc.typeTechnical reporten_US
dc.identifier.trnumberTR-86-26en_US
dc.type.dcmitypeTexten_US
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000033/01/TR-86-26.pdf


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record