| 
|
Quote: while a deterministic, prime number predicate is probably exponential, a probabilistic predicate is linear
topics >
all references >
references c-d >
Topic:
randomness
Topic:
probabilistic and randomized algorithms
Quotation Skeleton
The Complexity … of exactly determining whether N is prime is … [# of digits]. … Rabin himself [in Traub, J. Algorithms and Complexity, 1976] gives an algorithm for determining … time as a function of D(N). This example … if one is willing to replace certainty with … Google-1 Google-2
Copyright clearance needed for quotation.
Topic: randomness (16 items)
Topic: probabilistic and randomized algorithms (11 items)