Titlebook: High Performance Computing; Second Latin America Carla Osthoff,Philippe Olivier Alexandre Navaux,Pe Conference proceedings 2015 Springer In

SEED

Lucía Marroig,Camila Riverón,Sergio Nesmachnow,Esteban Mocskosptgründe für die schnelle Ausführung der einzelnen Funktionen ist die Assemblersprache, deren Ausführungszeit wesentlich kürzer ist als bei h?heren Programmiersprachen wie z. B. BASIC oder Pascal. In Assembler geschriebene Programme müssen genauso wie die h?heren Programmiersprachen in Bin?rcodes um

Latency

Emmanuell D. Carre?o,Eduardo Roloff,Philippe O. A. Navauxdeveloped by Zinoviev-Zyablov [2], [3], who modified it so that it could also correct many bursts of errors, without sacrificing the random error correcting capability. Unfortunately hitherto available analyses of the algorithm are rather involved — a fact which might have prevented the algorithm fr

支架

Carlos E. Gómez,César O. Díaz,César A. Forero,Eduardo Rosales,Harold Castrocompared with those needed using Macsyma (for the same polynomials, on the same computer)..The proposed algorithm includes original contributions : a strategy based on Stickelberger‘s theorem, a particular use of the Norm function. and a systematic use of sequences of squares/non-squares in GF (p).

按時(shí)間順序

Paula Verghelet,Esteban Mocskosre in arithmetical progression, that is, w.=w.-A and w.=w.+ A with A a function which depends of the number of words of weight three in C.(n,n-k). Furthermore we obtain some relations between s-sum-sets (s odd) and their parameters.

Definitive

compared with those needed using Macsyma (for the same polynomials, on the same computer)..The proposed algorithm includes original contributions : a strategy based on Stickelberger‘s theorem, a particular use of the Norm function. and a systematic use of sequences of squares/non-squares in GF (p).

PAN

Monica L. Hernandez,Matthieu Dreher,Carlos J. Barrios,Bruno Raffins of the two kinds of computations from the point of view of program semantics is made. The possibility of integrating these two kinds of computations in a unified computational framework is discussed. The use of p-adic arithmetic, as a possible useful interpretation of algebraic expression, is cons

definition

Ernesto Dufrechou,Pablo Ezzatti,Enrique S. Quintana-Ortí,Alfredo Remóndeveloped by Zinoviev-Zyablov [2], [3], who modified it so that it could also correct many bursts of errors, without sacrificing the random error correcting capability. Unfortunately hitherto available analyses of the algorithm are rather involved — a fact which might have prevented the algorithm fr

完成

Tiago Marques do Nascimento,Rodrigo Weber dos Santos,Marcelo Loboscodeveloped by Zinoviev-Zyablov [2], [3], who modified it so that it could also correct many bursts of errors, without sacrificing the random error correcting capability. Unfortunately hitherto available analyses of the algorithm are rather involved — a fact which might have prevented the algorithm fr

sorbitol

Reservation

Frederico Luís Cabral,Carla Osthoff,Diego Brand?o,Mauricio Kischinhevskycompared with those needed using Macsyma (for the same polynomials, on the same computer)..The proposed algorithm includes original contributions : a strategy based on Stickelberger‘s theorem, a particular use of the Norm function. and a systematic use of sequences of squares/non-squares in GF (p).