Multi-pass Space Complexity for Max-CUT

From Open Problems in Sublinear Algorithms

Revision as of 20:52, 16 September 2021 by Szhou (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to: navigation, search

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.

Retrieved from "https://sublinear.info/index.php?title=Waiting:Cyclic_Hash_Functions_for_Edit_Distance&oldid=1328"