Results 121 to 130 of about 3,178 (169)
Research on technology innovation path of Intelligent Manufacturing enterprises-Based on qualitative comparative analysis of fuzzy sets under TOE framework. [PDF]
PLoS OneLi S, Zhao F.
europepmc +1 more source
Conference Report: APPLICATION PORTABILITY PROFILE AND OPEN SYSTEM ENVIRONMENT USER'S FORUM Gaithersburg, MD May 9-10, 1995. [PDF]
J Res Natl Inst Stand Technol, 1995 Hungate JI, Gray MM, Liburdy KA.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Russian Mathematics, 2022
This article studies a combined primality test for natural numbers, called \textit{L2 test}, by combining the Lucas test and the Fermat condition test. The efficiency and complexity of this test are also analyzed, and a methodology for identifying composite numbers that pass the L2 test (called L2 pseudoprimes) is presented.
Ishmukhametov, S. T. +3 more
openaire +1 more source
This article studies a combined primality test for natural numbers, called \textit{L2 test}, by combining the Lucas test and the Fermat condition test. The efficiency and complexity of this test are also analyzed, and a methodology for identifying composite numbers that pass the L2 test (called L2 pseudoprimes) is presented.
Ishmukhametov, S. T. +3 more
openaire +1 more source
Papers from the international symposium on Symbolic and algebraic computation - ISSAC '92, 1992
Rabin’s algorithm is commonly used in computer algebra systems and elsewhere for primality testing. This paper presents an experience with this in the Axiom* computer algebra system. As a result of this experience, we suggest certain strengthenings of the algorithm.
openaire +1 more source
Rabin’s algorithm is commonly used in computer algebra systems and elsewhere for primality testing. This paper presents an experience with this in the Axiom* computer algebra system. As a result of this experience, we suggest certain strengthenings of the algorithm.
openaire +1 more source
Fooling Primality Tests on Smartcards
2020We analyse whether the smartcards of the JavaCard platform correctly validate primality of domain parameters. The work is inspired by Albrecht et al. [1], where the authors analysed many open-source libraries and constructed pseudoprimes fooling the primality testing functions.
Sedlacek Vladimir +2 more
openaire +1 more source
ACM Communications in Computer Algebra, 2020
In 1879, Laisant-Beaujeux gave the following result without proof: If n is a prime, then [EQUATION] This paper provides proofs of the result of Laisant-Beaujeux in two cases explicitly: (1) If an integer of the form n = 4k + 1, k > 0 is prime, then ([EQUATION]) and (2) If an integer of the form n = 4k + 3, k ≥ 0 is prime, then ...
openaire +1 more source
In 1879, Laisant-Beaujeux gave the following result without proof: If n is a prime, then [EQUATION] This paper provides proofs of the result of Laisant-Beaujeux in two cases explicitly: (1) If an integer of the form n = 4k + 1, k > 0 is prime, then ([EQUATION]) and (2) If an integer of the form n = 4k + 3, k ≥ 0 is prime, then ...
openaire +1 more source