標(biāo)題: Titlebook: Algorithmic Number Theory; 7th International Sy Florian Hess,Sebastian Pauli,Michael Pohst Conference proceedings 2006 Springer-Verlag Berl [打印本頁] 作者: Enkephalin 時間: 2025-3-21 17:13
書目名稱Algorithmic Number Theory影響因子(影響力)
書目名稱Algorithmic Number Theory影響因子(影響力)學(xué)科排名
書目名稱Algorithmic Number Theory網(wǎng)絡(luò)公開度
書目名稱Algorithmic Number Theory網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithmic Number Theory被引頻次
書目名稱Algorithmic Number Theory被引頻次學(xué)科排名
書目名稱Algorithmic Number Theory年度引用
書目名稱Algorithmic Number Theory年度引用學(xué)科排名
書目名稱Algorithmic Number Theory讀者反饋
書目名稱Algorithmic Number Theory讀者反饋學(xué)科排名
作者: deface 時間: 2025-3-21 21:35 作者: 存在主義 時間: 2025-3-22 03:18
Use of Extended Euclidean Algorithm in Solving a System of Linear Diophantine Equations with Boundedeter. This is used progressively by reducing a . variable problem into a two variable problem. Computational experiments indicate that for a given number of variables the running times decreases with the increase in the number of equations in the system.作者: 弓箭 時間: 2025-3-22 07:55 作者: 怪物 時間: 2025-3-22 08:54 作者: transient-pain 時間: 2025-3-22 15:39 作者: ELUDE 時間: 2025-3-22 20:02
A Modular Method for Computing the Splitting Field of a Polynomialreduces the computation of .. to solving systems of linear equations modulo some powers of . and Hensel liftings. We provide a careful treatment on reducing computational difficulty. We examine the ability/practicality of the method by experiments on a real computer and study its complexity.作者: Living-Will 時間: 2025-3-23 00:44
Practical Lattice Basis Sampling Reduction[||.||. ≤.] provided . is randomly sampled from .’s search space. We describe two algorithms that estimate the probability that a further . iteration will find an even shorter vector, one algorithm based on our formula for Pr[||.||. ≤.], the other based on the approach of Schnorr’s . analysis. Finally, we report on some cryptographic applications.作者: BOAST 時間: 2025-3-23 04:04
,Das Instrumentieren w?hrend der Operation, number of heuristics. In particular, we present data which supports some of the Cohen-Lenstra heuristics [8], Littlewood’s bounds on .(1,.) [14], and Bach’s bound on the maximum norm of the prime ideals required to generate the class group [1].作者: 1分開 時間: 2025-3-23 09:26 作者: 忍耐 時間: 2025-3-23 10:57 作者: myopia 時間: 2025-3-23 16:45
https://doi.org/10.1007/978-3-662-06513-6lattice reduction?—?for finding the small roots of multivariate polynomials modulo an integer. For our needs, we improve the lattice construction step of Coppersmith’s method: we describe a way to find a subset of a set of vectors that decreases the Minkowski theorem bound, in a rather general setup including Coppersmith-type lattices.作者: Bmd955 時間: 2025-3-23 19:29 作者: 梯田 時間: 2025-3-23 22:33 作者: Dungeon 時間: 2025-3-24 03:41
On the Computation of the Coefficients of a Modular Formion of the .. torsion points of which the representation consists is found via a height estimate, obtained from Arakelov theory, combined with numerical approximation. The height estimate implies that the required precision for the approximation grows at most polynomially in?..作者: ANN 時間: 2025-3-24 09:02
LLL on the Averager to give a clearer picture of the differences/similarities between the average and worst cases. Our work is intended to clarify the practical behavior of L. and to raise theoretical questions on its average behavior.作者: 壕溝 時間: 2025-3-24 14:29 作者: maverick 時間: 2025-3-24 15:16 作者: peak-flow 時間: 2025-3-24 19:08 作者: NOCT 時間: 2025-3-25 02:16 作者: JOT 時間: 2025-3-25 07:18 作者: carotenoids 時間: 2025-3-25 09:53
A Modular Method for Computing the Splitting Field of a Polynomiallois group .. by .-adic Stauduhar’s method. This method uses the knowledge of .. with its action on the roots of . over a .-adic number field, and it reduces the computation of .. to solving systems of linear equations modulo some powers of . and Hensel liftings. We provide a careful treatment on re作者: RAG 時間: 2025-3-25 14:35 作者: 命令變成大炮 時間: 2025-3-25 17:10 作者: 使長胖 時間: 2025-3-25 20:15 作者: ascetic 時間: 2025-3-26 01:32 作者: Ebct207 時間: 2025-3-26 07:49
Doubly-Focused Enumeration of Pseudosquares and Pseudocubesies known as pseudosquares and pseudocubes. In the process, a novel method of solving simultaneous congruences—doubly-focused enumeration— is examined. This technique, first described by D. J. Bernstein, allowed us to obtain record-setting sieve computations in software on general purpose computers.作者: 證明無罪 時間: 2025-3-26 12:32 作者: 草本植物 時間: 2025-3-26 13:54
LLL on the Averagehan what was expected from the worst-case proved bounds, both in terms of the running time and the output quality. In this article, we investigate this puzzling statement by trying to model the average case of lattice reduction algorithms, starting with the celebrated Lenstra-Lenstra-Lovász algorith作者: mechanical 時間: 2025-3-26 20:09
On the Randomness of Bits Generated by Sufficiently Smooth Functionsed to be statistically random most of the time. Here we investigate their computational hardness: given a part of the binary expansion of exp x, can one recover?.? We describe a heuristic technique to address this type of questions. It relies upon Coppersmith’s heuristic technique?—?itself based on 作者: 衰弱的心 時間: 2025-3-26 23:04
The Pseudosquares Prime Sieveperations with .. conjectured space). Our algorithm found all 13284 primes in the interval [10.,10.+10.] in about 4 minutes on a 1.3GHz Pentium IV..We also present an algorithm to find all pseudosquares .. up to . in sublinear time using very little space. Our innovation here is a new, space-efficie作者: Nonthreatening 時間: 2025-3-27 01:45
,Zur Frage der Cocaingew?hnung,perations with .. conjectured space). Our algorithm found all 13284 primes in the interval [10.,10.+10.] in about 4 minutes on a 1.3GHz Pentium IV..We also present an algorithm to find all pseudosquares .. up to . in sublinear time using very little space. Our innovation here is a new, space-efficie作者: 脫水 時間: 2025-3-27 08:39
The Elliptic Curve Database for Conductors to 130000ort on significant recent progress in enlarging the database of elliptic curves defined over ? to include all those of conductor?.≤130000. We also give various statistics, summarize the data, describe how it may be obtained and used, and mention some recent work regarding the verification of Manin’s “.=1” conjecture.作者: 捏造 時間: 2025-3-27 10:19 作者: 熱心 時間: 2025-3-27 17:01
Cyclic Polynomials Arising from Kummer Theory of Norm Algebraic Toritension’. The polynomials do not only give all the quintic cyclic extensions over the rationals by choosing the parameters but also classify all such extensions. Some arithmetic properties of the polynomials are also derived.作者: 顯示 時間: 2025-3-27 18:49 作者: 煉油廠 時間: 2025-3-28 01:52 作者: RUPT 時間: 2025-3-28 04:39
https://doi.org/10.1007/978-3-658-17981-6ort on significant recent progress in enlarging the database of elliptic curves defined over ? to include all those of conductor?.≤130000. We also give various statistics, summarize the data, describe how it may be obtained and used, and mention some recent work regarding the verification of Manin’s作者: Altitude 時間: 2025-3-28 09:58
Die wirtschaftliche Lage des Chirurgen,tation associated to the discriminant modular form?Δ can be computed in time polynomial in?.. As a consequence, Ramanujan’s .(.) for prime numbers . can be computed in time polynomial in?log...The mod?. Galois representation occurs in the Jacobian of the modular curve?..(.), whose genus grows quadra作者: 橫截,橫斷 時間: 2025-3-28 13:22
Der Operationssaal und seine Pflege,cription is then used to present an algorithm that computes the locally free class group. The algorithm is implemented in MAGMA for the case where the algebra is a group ring over the rational numbers.作者: 碎石 時間: 2025-3-28 18:16 作者: 蔓藤圖飾 時間: 2025-3-28 19:42 作者: 慢跑鞋 時間: 2025-3-29 02:07 作者: 轉(zhuǎn)向 時間: 2025-3-29 06:59
https://doi.org/10.1007/978-3-8349-8700-6e present paper, the known lower bound 1.06 for . is raised to 1.218, and the known upper bound –1.009 for . is lowered to –1.229. In addition, the explicit upper bound of Pintz [14] on the smallest number for which the Mertens conjecture is false, is reduced from . to .. Finally, new numerical evid作者: evaculate 時間: 2025-3-29 09:32
https://doi.org/10.1007/978-3-8349-8700-6nstein’s algorithm, which finds rigorous upper and lower bounds for Ψ(.,.). Bernstein’s original algorithm runs in time roughly linear in .. Our first, easy improvement runs in time roughly ... Then, assuming the Riemann Hypothesis, we show how to drastically improve this. In particular, if log. is 作者: chastise 時間: 2025-3-29 14:31 作者: Flat-Feet 時間: 2025-3-29 19:27 作者: periodontitis 時間: 2025-3-29 23:27 作者: BARK 時間: 2025-3-30 01:24 作者: 密碼 時間: 2025-3-30 04:34
https://doi.org/10.1007/978-3-662-06513-6han what was expected from the worst-case proved bounds, both in terms of the running time and the output quality. In this article, we investigate this puzzling statement by trying to model the average case of lattice reduction algorithms, starting with the celebrated Lenstra-Lenstra-Lovász algorith作者: calumniate 時間: 2025-3-30 11:05 作者: 價值在貶值 時間: 2025-3-30 13:42 作者: 婚姻生活 時間: 2025-3-30 17:28 作者: 藐視 時間: 2025-3-31 00:13 作者: flex336 時間: 2025-3-31 02:39
Algorithmic Number Theory978-3-540-36076-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 燒瓶 時間: 2025-3-31 08:59
0302-9743 Overview: 978-3-540-36075-9978-3-540-36076-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Locale 時間: 2025-3-31 12:18
https://doi.org/10.1007/978-3-658-17981-6ort on significant recent progress in enlarging the database of elliptic curves defined over ? to include all those of conductor?.≤130000. We also give various statistics, summarize the data, describe how it may be obtained and used, and mention some recent work regarding the verification of Manin’s “.=1” conjecture.作者: 媽媽不開心 時間: 2025-3-31 16:41 作者: 凈禮 時間: 2025-3-31 19:29
Operation in einem Privathause,tension’. The polynomials do not only give all the quintic cyclic extensions over the rationals by choosing the parameters but also classify all such extensions. Some arithmetic properties of the polynomials are also derived.作者: OWL 時間: 2025-4-1 00:00 作者: Initiative 時間: 2025-4-1 03:30 作者: Urologist 時間: 2025-4-1 08:25
https://doi.org/10.1007/978-3-658-17981-6We describe methods for explicit computation of Galois groups of certain tamely ramified .-extensions. In the finite case this yields a short list of candidates for the Galois group. In the infinite case it produces a family or few families of likely candidates.作者: Ambiguous 時間: 2025-4-1 13:46 作者: aerobic 時間: 2025-4-1 16:24
