標(biāo)題: Titlebook: Computer Algebra and Parallelism; Second International Richard E. Zippel Conference proceedings 1992 Springer-Verlag Berlin Heidelberg 1992 [打印本頁] 作者: dilate 時間: 2025-3-21 19:32
書目名稱Computer Algebra and Parallelism影響因子(影響力)
書目名稱Computer Algebra and Parallelism影響因子(影響力)學(xué)科排名
書目名稱Computer Algebra and Parallelism網(wǎng)絡(luò)公開度
書目名稱Computer Algebra and Parallelism網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Computer Algebra and Parallelism被引頻次
書目名稱Computer Algebra and Parallelism被引頻次學(xué)科排名
書目名稱Computer Algebra and Parallelism年度引用
書目名稱Computer Algebra and Parallelism年度引用學(xué)科排名
書目名稱Computer Algebra and Parallelism讀者反饋
書目名稱Computer Algebra and Parallelism讀者反饋學(xué)科排名
作者: 道學(xué)氣 時間: 2025-3-21 22:42 作者: Resection 時間: 2025-3-22 02:56 作者: tooth-decay 時間: 2025-3-22 06:36 作者: intrigue 時間: 2025-3-22 12:27 作者: 小平面 時間: 2025-3-22 14:47 作者: 小平面 時間: 2025-3-22 18:32
,Boolean Gr?bner bases and their MIMD implementation,FPS 140) gives experimental results obtained with boolean polynomials..The algorithms were implemented on the FPS T40 connected as a ring and as a hypercube of processors. The first implementation shows the interest of the parallelization. The second one, based on a divide and conquer strategy, has 作者: interrogate 時間: 2025-3-22 23:45 作者: Concomitant 時間: 2025-3-23 04:15 作者: PRISE 時間: 2025-3-23 09:32
Effects of Component Interaction,o calculated in parallel) are used to deal with common symmetries arising in the calculations. The techniques are illustrated by calculations to determine the number of rational points of a polynomial surface over several fields, quantities which are useful in analyzing certain cyclic codes.作者: 誘導(dǎo) 時間: 2025-3-23 10:41
Reliability and Risk in Perspective,e arbitrary precision integer arithmetic and the usage of decomposition techniques. Especially the decomposition approach, where applicable, leads to massive parallelism in the problem solution, which results in a breakthrough for several problems.作者: 豪華 時間: 2025-3-23 16:39
Finite field arithmetic using the connection machine,o calculated in parallel) are used to deal with common symmetries arising in the calculations. The techniques are illustrated by calculations to determine the number of rational points of a polynomial surface over several fields, quantities which are useful in analyzing certain cyclic codes.作者: FUSC 時間: 2025-3-23 20:18 作者: Triglyceride 時間: 2025-3-23 23:42 作者: 燒烤 時間: 2025-3-24 02:21
J. M. Izquierdo,M. Sanchez-Pereavantage of a vectorized floating point unit. Our experiences with this approach are also discussed..PAC has been implemented on the FPS T series hypercube (32 processors) and an implementation on the TELMAT Meganode (128 processors) is in progress.作者: HIKE 時間: 2025-3-24 06:58 作者: Indurate 時間: 2025-3-24 13:08
0302-9743 rsity in May 1990. The eight papers inthe book fall into three groups.The first three papers discuss particular programmingsubstrates for parallel symbolic computation, especially fordistributed memory machines. The nextthree papers discussnovel ways of computing with elements of finite fields andwi作者: 感染 時間: 2025-3-24 17:11
https://doi.org/10.1007/BFb0033653ercube of processors. The first implementation shows the interest of the parallelization. The second one, based on a divide and conquer strategy, has a behavior very close to the sequential algorithm..We evaluate the contribution of the parallelism by a direct comparison of sequential and parallel times without references to complexity.作者: 白楊魚 時間: 2025-3-24 19:32 作者: 外貌 時間: 2025-3-24 23:38 作者: GULP 時間: 2025-3-25 05:26
0302-9743 their computation. One usesvectorprocessing on the Cray and achieves significant speed-ups.The other uses a distributed memory multiprocessor andeffectively explores the trade-offs involved with differentinterconnect topologies of the multiprocessors.978-3-540-55328-1978-3-540-47026-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: inflate 時間: 2025-3-25 10:25
,Embarrassingly parallel algorithms for algebraic number arithmetic — and some less trivial issues,.. The best known power-sum algorithm is based on Newton‘s identity, which may be treated as a linear recurrence, whose solution, conventionally understood to be of complexity O(.), will dominate the time of the multiplication algorithm and significantly increase the addition time. A parallel algori作者: Exposition 時間: 2025-3-25 12:42 作者: thrombosis 時間: 2025-3-25 18:37
The S-threads environment for parallel symbolic computation,作者: AMITY 時間: 2025-3-26 00:00 作者: Commonwealth 時間: 2025-3-26 03:13 作者: Bmd955 時間: 2025-3-26 06:07 作者: 脊椎動物 時間: 2025-3-26 11:26 作者: 放縱 時間: 2025-3-26 14:17 作者: 易于 時間: 2025-3-26 17:09
Reliability and Risk in Perspective,nted by a list of character strings recursively involving root indices, +, ?, x, and integer terms or radicands. Algorithms for sums, products, etc., in the defining polynomial representation, are based on the theory of symmetric functions and have relatively efficient implementations using polynomi作者: transplantation 時間: 2025-3-26 22:42
Assessment of Reliability Function,parallel version, based on threads, of the SAC-2 computer algebra system. A discussion of the implementation and its performance is given. Our timing results were obtained on a shared memory multiprocessor implementation using the Encore Multimax.作者: 孤僻 時間: 2025-3-27 03:25
Reliability and Risk in Perspective,sources with their requirements for cpu time or storage. The well-known reason for that is the swell of intermediate polynomials, which are generated during the basis calculation and which are in most cases not included in either the given set of polynomials or the resulting Gr?bner basis. In this p作者: certitude 時間: 2025-3-27 06:32 作者: interrupt 時間: 2025-3-27 11:01 作者: progestogen 時間: 2025-3-27 13:55
978-3-540-55328-1Springer-Verlag Berlin Heidelberg 1992作者: 殺子女者 時間: 2025-3-27 18:28
Computer Algebra and Parallelism978-3-540-47026-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: abject 時間: 2025-3-28 01:50 作者: alliance 時間: 2025-3-28 04:31 作者: 小丑 時間: 2025-3-28 08:33
Designing the Digital Transformation978-3-319-59144-5Series ISSN 0302-9743 Series E-ISSN 1611-3349
