Difference between revisions of "Waiting:Cyclic Hash Functions for Edit Distance"

From Open Problems in Sublinear Algorithms
Jump to: navigation, search
 
Line 1: Line 1:
 
{{Header
 
{{Header
|title=Multi-pass Space Complexity for Max-CUT
+
|title=Cyclic Hash Functions for Edit Distance
 
|source=WALDO 2021
 
|source=WALDO 2021
|who=Santhoshini Velusamy
+
|who=Samson Zhou
 
}}
 
}}
 
Is the number of primes infinite? Note that if the answer is positive, the proof has to be of length ''sublinear'' in the number of primes.
 
Is the number of primes infinite? Note that if the answer is positive, the proof has to be of length ''sublinear'' in the number of primes.

Latest revision as of 20:54, 16 September 2021

Suggested by Samson Zhou
Source WALDO 2021

Is the number of primes infinite? Note that if the answer is positive, the proof has to be of length sublinear in the number of primes.