Spelling suggestions: "subject:"sieve."" "subject:"nieve.""
1 |
An Improvement of The Multiple Polynomial Quadratic SieveHou, Ya-Fang 25 August 2008 (has links)
Large integer factoring problem is a difficult computing problem. The security of many public-key cryptograohy system depend on the large interger factoring problem. Dr. Guan implement ¡uThe Multiple Polynomail Quadratic Sieve Algorithm¡v and name the program ¡uGQS¡v. The program successfully factor RSA-130 interger in 2004. It can reduce the time of sieving that the MPQS algorithm retain the smooth number with one or two prime. But finally the size of factor basis is large. We use some of the prime retained by the MPQS algorithm to match with the smooth number and reduce the size of factor basis. And then we can reduce the time of factoring. In this paper, we implement our idea in a AIX server and the result of this paper can be a suggestion of the improvement of MPQS.
|
2 |
Inference of particle size from images of heap profilesBooth, Del William Philip Booth January 2003 (has links)
No description available.
|
3 |
Characterisation of phloem proteins expressed in response to phloem feeding insectsBarnes, Alan Jeffery January 2002 (has links)
No description available.
|
4 |
An ultrastructural and immunochemical study of sieve elementsSmith, L. M. January 1984 (has links)
No description available.
|
5 |
The upper chromatic number and chromatic polynomials of some mixed hypergraphs林妤芬 Unknown Date (has links)
本文分為兩章. 第一章先介紹sieve-number(即s(H)) ,並將所有mixed hypergraph的最大著色數能用n-s(H)的圖形條件限制出來.再討論能用s(H)表示其最大著色數的圖形. 第二章主要是討論interval mixed hypergraph的著色方程式.
|
6 |
The general linear model for censored dataZhao, Yonggang 05 September 2003 (has links)
No description available.
|
7 |
EXAFS studies of polyoxometalates and polyoxometalate-pillared layered double hydroxidesPillinger, Martyn January 1994 (has links)
No description available.
|
8 |
Non-linear image processing techniques and their application to the analysis of antirrhinum petal shape developmentImpey, Stephen J. January 2000 (has links)
No description available.
|
9 |
An Exposition of Selberg's SieveDalton, Jack 01 January 2017 (has links)
A number of exciting recent developments in the field of sieve theory have been done concerning bounded gaps between prime numbers. One of the main techniques used in these papers is a modified version of Selberg's Sieve from the 1940's. While there are a number of sources that explain the original sieve, most, if not all, are quite inaccessible to those without significant experience in analytic number theory. The goal of this exposition is to change that. The statement and proof of the general form of Selberg's sieve is, by itself, difficult to understand and appreciate. For this reason, the inital exposition herein will be about one particular application: to recover Chebysheff's upper bound on the order of magnitude of the number of primes less than a given number. As Selberg's sieve follows some of the same initial steps as the more elementary sieve of Eratosthenes, this latter sieve will be worked through as well.
To help the reader get a better sense of Selberg's sieve, a few particular applications are worked through, including an upper bound on the number of twin primes less than a number. This will then be used to show the convergence of the reciprocals of the twin primes.
|
10 |
On Sufficient Conditions for the Existence of Twin Values in Sieves over the Natural NumbersSzramowski, Luke 12 May 2020 (has links)
No description available.
|
Page generated in 0.0371 seconds