TechQA.

Question

CUDA kernel for determining primes slower than OpenMP code - how can I optimize it?

score 135 · Answer 1 · 2023-01-29T17:50:23.813000

0

Answer

135

Views

CUDA kernel for determining primes slower than OpenMP code - how can I optimize it?

135 views Asked by Monsieur AZERTY At 29 January 2023 at 17:50

score 55 · Answer 2 · 2023-01-27T13:11:42.600000

Basic primality test predicate in Prolog

55 views Asked by Keroten At 27 January 2023 at 13:11

score 422 · Answer 3 · 2022-04-28T02:25:05.947000

primality test function is_prime (n, k) based on Fermat Little Theorem,

422 views Asked by Ibrahim Ahmed At 28 April 2022 at 02:25

score 141 · Answer 4 · 2022-04-09T20:54:14.120000

I am trying to write a function in Python encapsulating the Miller-Rabin primality test, but it is very slow

141 views Asked by Delta Foxtrot At 09 April 2022 at 20:54

score 309 · Answer 5 · 2022-04-06T04:24:41.673000

in Primality Test ,i do not understand why we increase i by 6 (i=i+6) ? and the if statment conditions in the for loop block?

309 views Asked by MOHAMMADE At 06 April 2022 at 04:24

score 359 · Answer 6 · 2021-06-19T06:30:09.923000

C++: Why/How a Break Statement Works In This Code?

359 views Asked by F.N. At 19 June 2021 at 06:30

score 100 · Answer 7 · 2021-04-21T08:57:56.820000

Fermat's primality test

100 views Asked by Alex Kang At 21 April 2021 at 08:57

score 196 · Answer 8 · 2021-04-02T03:30:25.793000

Numpy AKS primality function

196 views Asked by mttpgn At 02 April 2021 at 03:30

score 221 · Answer 9 · 2021-01-03T16:00:22.797000

Primality Test Comparison

221 views Asked by vengy At 03 January 2021 at 16:00

score 40 · Answer 10 · 2020-12-29T16:43:59.257000

Java: read an int and check its primality. If it's not prime, repeat, but max x times

40 views Asked by LearningDaBasics At 29 December 2020 at 16:43

score 98 · Answer 11 · 2020-10-13T05:34:10.207000

Why does my primality test stop after 1 and not seem to be able to go on?

98 views Asked by jwmgregory At 13 October 2020 at 05:34

score 547 · Answer 12 · 2020-10-05T06:03:25.137000

Converting isPrime() Python to Haskell

547 views Asked by Prithvi Boinpally At 05 October 2020 at 06:03

score 178 · Answer 13 · 2020-09-25T14:18:07.310000

What is the best algorithm to determine if N is a prime number (if N is [2 <= N <= 2^63-1])?

178 views Asked by AB3 At 25 September 2020 at 14:18

score 169 · Answer 14 · 2020-08-28T12:27:23.537000

How do I check the primality of a very large BigInt fast?

169 views Asked by MindStudio At 28 August 2020 at 12:27

score 6311 · Answer 15 · 2020-07-25T03:02:56.147000

JavaScript: Check if number is prime with recursion

6.3k views Asked by Woody P Lucas At 25 July 2020 at 03:02

score 1157 · Answer 16 · 2020-07-14T20:26:48.213000

Time complexity of Miller Rabin Primality Test

1.1k views Asked by Greg At 14 July 2020 at 20:26

score 538 · Answer 17 · 2020-07-14T14:20:50.450000

Time Complexity of this primality test function

538 views Asked by Greg At 14 July 2020 at 14:20

score 137 · Answer 18 · 2020-06-06T09:23:50.890000

Why is my algorithm about Fermat primality test so slow?

137 views Asked by Land At 06 June 2020 at 09:23

score 484 · Answer 19 · 2020-04-22T06:39:42.497000

Lucas-Lehmer test using Python not working for large numbers

484 views Asked by Satyaki Guha At 22 April 2020 at 06:39

score 551 · Answer 20 · 2020-03-26T06:55:09.990000

Which is more efficient to use in a for loop, i<sqrt(n) or i*i<(n)?

551 views Asked by Ravi Keshri At 26 March 2020 at 06:55

TechQA.

List Question

CUDA kernel for determining primes slower than OpenMP code - how can I optimize it?

Basic primality test predicate in Prolog

primality test function is_prime (n, k) based on Fermat Little Theorem,

I am trying to write a function in Python encapsulating the Miller-Rabin primality test, but it is very slow

in Primality Test ,i do not understand why we increase i by 6 (i=i+6) ? and the if statment conditions in the for loop block?

C++: Why/How a Break Statement Works In This Code?

Fermat's primality test

Numpy AKS primality function

Primality Test Comparison

Java: read an int and check its primality. If it's not prime, repeat, but max x times

Why does my primality test stop after 1 and not seem to be able to go on?

Converting isPrime() Python to Haskell

What is the best algorithm to determine if N is a prime number (if N is [2 <= N <= 2^63-1])?

How do I check the primality of a very large BigInt fast?

JavaScript: Check if number is prime with recursion

Time complexity of Miller Rabin Primality Test

Time Complexity of this primality test function

Why is my algorithm about Fermat primality test so slow?

Lucas-Lehmer test using Python not working for large numbers

Which is more efficient to use in a for loop, i<sqrt(n) or i*i<(n)?

Popular Questions

Trending Questions