Výsledky vyhľadávania - "Number-theoretic algorithms"
-
1
Algorithms for Inversion Mod p^k
ISSN: 0018-9340, 1557-9956Vydavateľské údaje: IEEE 01.06.2020Vydané v IEEE transactions on computers (01.06.2020)“…This article describes and analyzes all existing algorithms for computing <inline-formula><tex-math notation="LaTeX">x=a^{-1}\pmod {p^k}</tex-math>…”
Získať plný text
Journal Article -
2
A randomized sublinear time parallel GCD algorithm for the EREW PRAM
ISSN: 0020-0190, 1872-6119Vydavateľské údaje: Amsterdam Elsevier B.V 01.02.2010Vydané v Information processing letters (01.02.2010)“…We present a randomized parallel algorithm that computes the greatest common divisor of two integers of n bits in length with probability 1 − o ( 1 ) that…”
Získať plný text
Journal Article -
3
Short vectors of planar lattices via continued fractions
ISSN: 0020-0190, 1872-6119Vydavateľské údaje: Amsterdam Elsevier B.V 31.07.2001Vydané v Information processing letters (31.07.2001)“…We show that a shortest vector of a 2-dimensional integral lattice with respect to the ℓ ∞ -norm can be computed with a constant number of extended-gcd…”
Získať plný text
Journal Article -
4
Computational search for Gaussian perfect integers
Vydavateľské údaje: IEEE 01.11.2015Vydané v ICCC : 2015 International Conference on Control, Communication & Computing India : 19-21 November 2015, Trivandrum, Kerala, India (01.11.2015)“…This paper is primarily concerned with the definition of perfect integers in the Gaussian plane and then testing their existence with the help of number…”
Získať plný text
Konferenčný príspevok.. -
5
A space-efficient fast prime number sieve
ISSN: 0020-0190, 1872-6119Vydavateľské údaje: Amsterdam Elsevier B.V 22.07.1996Vydané v Information processing letters (22.07.1996)“…We present a new algorithm that finds all primes up to n using at most O( n log log n ) arithmetic operations and O( n (log n log log n) ) space. This…”
Získať plný text
Journal Article -
6
Perfect power testing
ISSN: 0020-0190, 1872-6119Vydavateľské údaje: Amsterdam Elsevier B.V 22.04.1996Vydané v Information processing letters (22.04.1996)“…Bach and Sorenson present two algorithms for testing whether a number n is a perfect power, with average running time O( log 2 n) under the assumption that n…”
Získať plný text
Journal Article -
7
An algorithmic approach to Ramanujan–Kolberg identities
ISSN: 0747-7171, 1095-855XVydavateľské údaje: Elsevier Ltd 01.05.2015Vydané v Journal of symbolic computation (01.05.2015)“…Let M be a given positive integer and r=(rδ)δ|M a sequence indexed by the positive divisors δ of M. In this paper we present an algorithm that takes as input a…”
Získať plný text
Journal Article -
8
A new bias-corrected estimator method in extreme value distributions with small sample size
ISSN: 0094-9655, 1563-5163Vydavateľské údaje: Abingdon Taylor & Francis 12.12.2022Vydané v Journal of statistical computation and simulation (12.12.2022)“…This paper proposes a bias-corrected expression for maximum likelihood estimators using the sequential number-theoretic method for optimization (SNTO) to…”
Získať plný text
Journal Article -
9
Dancing samba with Ramanujan partition congruences
ISSN: 0747-7171, 1095-855XVydavateľské údaje: Elsevier Ltd 01.01.2018Vydané v Journal of symbolic computation (01.01.2018)“…The article presents an algorithm to compute a C[t]-module basis G for a given subalgebra A over a polynomial ring R=C[x] with a Euclidean domain C as the…”
Získať plný text
Journal Article -
10
An algorithmic approach to Ramanujan’s congruences
ISSN: 1382-4090, 1572-9303Vydavateľské údaje: Boston Springer US 01.11.2009Vydané v The Ramanujan journal (01.11.2009)“…In this paper we present an algorithm that takes as input a generating function of the form and three positive integers m , t , p , and which returns true if…”
Získať plný text
Journal Article -
11
Number-Theoretic Attack on Lyuu-Wu's Multi-proxy Multi-signature Scheme
ISBN: 0769537448, 9780769537443Vydavateľské údaje: IEEE 01.08.2009Vydané v 2009 fifth International Conference on Information Assurance and Security : 18-20 August 2009 (01.08.2009)“…Y. D. Lyuu and M. L. Wu had proposed an improved multi-proxy multi-signature scheme, which was claimed to resist the forge attack. Lately, L. Guo and G. Wang…”
Získať plný text
Konferenčný príspevok..

