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

From Open Problems in Sublinear Algorithms
Jump to: navigation, search
(Created page with "{{Header |title=Cyclic Hash Functions for Edit Distance |source=WALDO 2021 |who=Samson Zhou }} Is the number of primes infinite? Note that if the answer is positive, the proof...")
 
Line 1: Line 1:
 
{{Header
 
{{Header
|title=Cyclic Hash Functions for Edit Distance
+
|title=Multi-pass Space Complexity for Max-CUT
 
|source=WALDO 2021
 
|source=WALDO 2021
|who=Samson Zhou
+
|who=Santhoshini Velusamy
 
}}
 
}}
 
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.

Revision as of 20:52, 16 September 2021

Suggested by Santhoshini Velusamy
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.