Results 51 to 60 of about 463 (134)

An Explainable Artificial Intelligence Software Tool for Weight Management Experts (PRIMO): Mixed Methods Study. [PDF]

open access: yesJ Med Internet Res, 2023
Fernandes GJ   +6 more
europepmc   +1 more source

Primality Testing in Polynomial Time

open access: yes, 2003
These notes contain a description and correctness proof of the deterministic polynomial-time primality testing algorithm of Agrawal, Kayal, and Saxena. Some background from number theory and algebra is given in Section 4.
Michiel Smid
core  

Prime Numbers and Primality Testing

open access: yes, 2018
The Fundamental Theorem of Arithmetic states that every composite integer can be written as a unique product of prime numbers. As new prime numbers are being discovered, mathematicians continue their search for larger and larger prime numbers.
Chu, Huy
core  

Primality testing and integer factorisation [PDF]

open access: yes, 1990
The problem of finding the prime factors of large composite numbers has always been of mathematical interest. With the advent of public key cryptosystems it is also of practical importance, because the security of some of these cryptosystems, such as the
Brent, Richard P
core  

Polynomial time primality testing

open access: yes, 2020
The topic of my thesis is the testing of prime numbers in polynomial time. The text focuses on the specific algorithm published in 2002 by Manindra Agrawal, Neeraj Kayal and Nitin Saxena and it is known as the AKS primality test.
Bednaříková, Alžběta
core  

Orienteering with One Endomorphism. [PDF]

open access: yesMathematica (N Y), 2023
Arpin S   +5 more
europepmc   +1 more source

Primality Testing with Artin Symbols

open access: yes, 1982
It is a recent discovery that many primality testing algorithms are based on the following trivial theorem.
openaire   +3 more sources

Home - About - Disclaimer - Privacy