Titlebook: Computational and Algorithmic Problems in Finite Fields; Igor E. Shparlinski Book 1992 Springer Science+Business Media Dordrecht 1992 Nota

只看該作者 · 發(fā)表于 2025-3-21 16:14:27

書目名稱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é)科排名

只看該作者 · 發(fā)表于 2025-3-21 22:24:53

Computational and Algorithmic Problems in Finite Fields978-94-011-1806-4Series ISSN 0169-6378

只看該作者 · 發(fā)表于 2025-3-22 01:24:02

0169-6378 Overview: 978-94-010-4796-8978-94-011-1806-4Series ISSN 0169-6378

只看該作者 · 發(fā)表于 2025-3-22 07:05:54

只看該作者 · 發(fā)表于 2025-3-22 11:31:13

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.

只看該作者 · 發(fā)表于 2025-3-22 15:38:57

只看該作者 · 發(fā)表于 2025-3-22 17:28:46

只看該作者 · 發(fā)表于 2025-3-22 21:42:21

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]).

只看該作者 · 發(fā)表于 2025-3-23 04:05:26

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

只看該作者 · 發(fā)表于 2025-3-23 05:33:45

		自動登錄	找回密碼
密碼			To register

關(guān)于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務(wù)流程	影響因子官網(wǎng)	吾愛論文網(wǎng)	大講堂	北京大學(xué)	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點評	投稿經(jīng)驗總結(jié)	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學(xué)	Yale Uni.	Stanford Uni.
\|Archiver\|手機版\|小黑屋\| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-25 13:33
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved