Results 261 to 270 of about 2,924 (299)

Constructive <i>Q</i>-Matrix Identifiability via Novel Tensor Unfolding. [PDF]

Psychometrika
Gu Y.
europepmc   +1 more source

Scattering diagrams, tight gradings, and generalized positivity. [PDF]

Proc Natl Acad Sci U S A
Burcroff A, Lee K, Mou L.
europepmc   +1 more source

Computing With Residue Numbers in High-Dimensional Representation. [PDF]

Neural Comput
Kymn CJ, Kleyko D, Frady EP, Bybee C, Kanerva P, Sommer FT, Olshausen BA.   +6 more
europepmc   +1 more source

Emotion induction by western music across personality types using internet of things technology. [PDF]

Sci Rep
Ru D, Wei Z.
europepmc   +1 more source

A Survey on Proof of Sequential Work: Development, Security Analysis, and Application Prospects. [PDF]

Entropy (Basel)
Zhang J, Ran Y, Huang X, Zuo C, Duan J, Pan Y, Wang L, Wang J.   +7 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Elliptic Curve and Integer Factorization

Lecture Notes in Computer Science, 2021
Suppose that we want to factor an integer D where \(D=pq\), and p, q are two distinct odd primes. Assuming the parity conjecture and BSD conjecture hold, we reduce the problem of integer factorization to computing the generators of the Mordell-Weil group of \(E_{Dr}:y^{2}=x^{3}-Drx\), where r is a suitable integer with \((r,D)=1\). Then for the sake of
Zhizhong Pan, Xiao Li
exaly   +2 more sources

An integrated parallel GNFS algorithm for integer factorization based on Linbox Montgomery block Lanczos method over GF(2)

Computers and Mathematics With Applications, 2010
Integer factorization is known to be one of the most important and useful methods in number theory and arithmetic. It also has a very close relationship to some algorithms in cryptography such as RSA algorithm.
Laurence T Yang, Sang-Soo Yeo
exaly   +2 more sources

Integer Factorization

, 2016
openaire   +2 more sources

An efficient method for integer factorization

2015 IEEE International Symposium on Circuits and Systems (ISCAS), 2015
In this paper, we propose an efficient method for integer factorization and it can be a good solution to sieving part of General Number Field Sieve. The mid-size integer factorization module adopts highly parallel structure to save operation time to a great extent.
Haibo Yu, Guoqiang Bai 0001
openaire   +1 more source