標(biāo)題: Titlebook: Computational and Algorithmic Problems in Finite Fields; Igor E. Shparlinski Book 1992 Springer Science+Business Media Dordrecht 1992 Nota [打印本頁] 作者: Reagan 時(shí)間: 2025-3-21 16:14
書目名稱Computational and Algorithmic Problems in Finite Fields影響因子(影響力)
書目名稱Computational and Algorithmic Problems in Finite Fields影響因子(影響力)學(xué)科排名
書目名稱Computational and Algorithmic Problems in Finite Fields網(wǎng)絡(luò)公開度
書目名稱Computational and Algorithmic Problems in Finite Fields網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Computational and Algorithmic Problems in Finite Fields被引頻次
書目名稱Computational and Algorithmic Problems in Finite Fields被引頻次學(xué)科排名
書目名稱Computational and Algorithmic Problems in Finite Fields年度引用
書目名稱Computational and Algorithmic Problems in Finite Fields年度引用學(xué)科排名
書目名稱Computational and Algorithmic Problems in Finite Fields讀者反饋
書目名稱Computational and Algorithmic Problems in Finite Fields讀者反饋學(xué)科排名
作者: Exonerate 時(shí)間: 2025-3-21 22:24
Computational and Algorithmic Problems in Finite Fields978-94-011-1806-4Series ISSN 0169-6378 作者: Costume 時(shí)間: 2025-3-22 01:24
0169-6378 Overview: 978-94-010-4796-8978-94-011-1806-4Series ISSN 0169-6378 作者: REIGN 時(shí)間: 2025-3-22 07:05 作者: Conspiracy 時(shí)間: 2025-3-22 11:31
B. R. Judd,D. J. Newman,Betty Ngetries and to other areas of discrete mathematics have been described in [580, 705, 706, 732] (see also Chapter 5, Chapter 6, and Chapter 7 of the present work). Here we only discuss a number of papers, which have to do with new applications of finite fields.作者: 徹底明白 時(shí)間: 2025-3-22 15:38 作者: 徹底明白 時(shí)間: 2025-3-22 17:28 作者: 無所不知 時(shí)間: 2025-3-22 21:42
Bruno Gruber,F. A. Matsen,M. S. Thomass. These polynomials have many applications in coding theory, cryptography, complexity theory, computer science, computational mathematics (see the books [90, 601, 705, 706, 732] and the recent papers [10, 44, 143, 224, 311, 379, 448, 450, 874]).作者: Osteoporosis 時(shí)間: 2025-3-23 04:05
Bruno Gruber,Romuald Lenczewski codes recently introduced in [425, 426] as well as some other relations between coding theory, algebraic curves over finite fields, and estimates of exponential sums. Moreover, we describe connections between codes and lattice packings which were found during the last years (see [263, 717, 997, 119作者: moratorium 時(shí)間: 2025-3-23 05:33 作者: Aerate 時(shí)間: 2025-3-23 11:26 作者: heckle 時(shí)間: 2025-3-23 14:08
https://doi.org/10.1007/978-94-011-1806-4Notation; algebra; algorithms; coding theory; computer; computer science; cryptography; finite field; number作者: Intact 時(shí)間: 2025-3-23 21:07
978-94-010-4796-8Springer Science+Business Media Dordrecht 1992作者: 都相信我的話 時(shí)間: 2025-3-23 22:47 作者: 拔出 時(shí)間: 2025-3-24 02:25 作者: cleaver 時(shí)間: 2025-3-24 06:45
Why We Believe in the Einstein Theory,Now we are going to consider problems related to complexity of computation in finite fields such as finding power, normal, primitive normal and other bases for finite fields, computing some special functions in finite fields, polynomial multiplication and interpolation, bilinear complexity, complexity of arithmetic and matrix operations.作者: 要塞 時(shí)間: 2025-3-24 14:08
The Mysterious World of Symmetry in Physics,Here we consider elliptic curves (or algebraic curves of genus . = 1) for more details (see [602, 657, 1104, 1175, 1295]).作者: 昏睡中 時(shí)間: 2025-3-24 17:40 作者: foodstuff 時(shí)間: 2025-3-24 19:22 作者: 開花期女 時(shí)間: 2025-3-24 23:43 作者: foreign 時(shí)間: 2025-3-25 04:31
The Distribution of Irreducible and Primitive Polynomials,Another interesting problem, related to irreducible, primitive and other special polynomials, is investigation of their distribution in various subsets of .(.). This problem is important as in some applications polynomials may have special forms (for example, have small height or weight).作者: In-Situ 時(shí)間: 2025-3-25 10:16 作者: Foreshadow 時(shí)間: 2025-3-25 13:18
Elliptic Curves,Here we consider elliptic curves (or algebraic curves of genus . = 1) for more details (see [602, 657, 1104, 1175, 1295]).作者: 數(shù)量 時(shí)間: 2025-3-25 16:21
Recurrent Sequences in Finite Fields and Cyclic Linear Codes,Linear recurrent sequences in finite fields appear in many different areas of mathematics such as coding theory (in theory of cyclic linear codes), computational mathematics (when constructing pseudo-random numbers and quadrature formulas), etc. (see [601, 705, 706, 732, 1124]).作者: CLIFF 時(shí)間: 2025-3-25 22:30 作者: 外觀 時(shí)間: 2025-3-26 02:27 作者: Arctic 時(shí)間: 2025-3-26 06:35
Finite Fields and Discrete Mathematics,etries and to other areas of discrete mathematics have been described in [580, 705, 706, 732] (see also Chapter 5, Chapter 6, and Chapter 7 of the present work). Here we only discuss a number of papers, which have to do with new applications of finite fields.作者: Cardiac 時(shí)間: 2025-3-26 08:28 作者: 阻塞 時(shí)間: 2025-3-26 16:14
Computational and Algorithmic Problems in Finite Fields作者: HAVOC 時(shí)間: 2025-3-26 17:10
Internal Symmetries and Gauge Theories, results of this type can be found in the books [20, 22, 280, 427, 601, 604, 705, 706, 737, 1143, 1199] and the surveys [50, 96, 203, 312, 385, 398, 436, 549, 683, 693, 738, 863, 1095, 1116, 1279, 1295], devoted to more general questions. See also [12] for related open problems.作者: 重疊 時(shí)間: 2025-3-26 23:31 作者: Cholesterol 時(shí)間: 2025-3-27 02:20
Bruno Gruber,Romuald Lenczewskiexponential sums. Moreover, we describe connections between codes and lattice packings which were found during the last years (see [263, 717, 997, 1198, 1199]) and show that the same approach can also give good lattice coverings.作者: saphenous-vein 時(shí)間: 2025-3-27 07:38 作者: Keratectomy 時(shí)間: 2025-3-27 10:10
Introduction, irreducible and primitive polynomials, the distribution of these polynomials and the distribution of primitive points on elliptic curves, the construction of bases of various types, and new applications of finite fields to other areas of mathematics. For completeness we include also two special cha作者: 暖昧關(guān)系 時(shí)間: 2025-3-27 13:57 作者: 治愈 時(shí)間: 2025-3-27 17:52 作者: 抱怨 時(shí)間: 2025-3-28 01:27 作者: Canary 時(shí)間: 2025-3-28 03:17
Congruences,611, 839], construction of pseudo-random numbers via the congruence generator [601, 839, 864], parallel and error-free computations using modular arithmetic [20, 434, 601], and cryptography [143, 604, 644, 983, 1188].作者: 使出神 時(shí)間: 2025-3-28 06:54
Book 2022Macht ein und auf die Prinzipien, nach denen Macht in einer Gesellschaft sprachlich durchgesetzt wird. Dabei unter-scheidet sie zwei Arten von Machtausübung: die Macht durch die Sprache und deren Gebrauchsbedingungen selbst und die von Menschen ausgeübte Macht durch Sprachregelung. Anschlie?end zeig作者: Barter 時(shí)間: 2025-3-28 13:55
The Nature and Assessment of Damages,ject to undue off-sets.. Damages may also serve as nominal recognition that a person’s rights have been infringed,. and, in appropriate circumstances, nominal rather than compensatory damages may be awarded. Whether and in what circumstances exemplary or punitive damages may be awarded is considered further below.作者: Progesterone 時(shí)間: 2025-3-28 14:37 作者: irritation 時(shí)間: 2025-3-28 18:54 作者: Nuance 時(shí)間: 2025-3-29 00:44 作者: 知識(shí)分子 時(shí)間: 2025-3-29 06:35
Sophia Frangoue e?ective) form of celebrating Gabriele’s birthday: a collection of new papers written by his main collaborators and friends on the various aspects of th- retical physics that have been the object of his research work, during his long and fruitful career.作者: medieval 時(shí)間: 2025-3-29 10:58
Book 1999menting and analyzing the effects of program activ- ity. Success Stories as Hard Data is designed to be readable, practical, and clear. Its author does not ignore previous scholarly work, but chooses to emphasize real- world applications. For this Dr. Kibei is to be applauded.作者: 手榴彈 時(shí)間: 2025-3-29 15:14
PKIX Certificate Status in Hybrid MANETsDie Arbeit beschr?nkt sich zun?chst auf Brücken aus einfachen, eineinhalbfachen und doppelten Rautentr?gern mit untenliegender Fahrbahn.作者: intuition 時(shí)間: 2025-3-29 17:30 作者: 男學(xué)院 時(shí)間: 2025-3-29 22:16
Book 2004obile applications. Second, that the authors be able to provide an introduction to the technologies with which they work. Third, that each chapter include case studies and lessons learned from empirical usability evaluations. And fourth, that each author include in the chapter some fundamental knowl
