<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://sublinear.info/index.php?action=history&amp;feed=atom&amp;title=Waiting%3AMulti-pass_Space_Complexity_for_Max-CUT</id>
	<title>Waiting:Multi-pass Space Complexity for Max-CUT - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://sublinear.info/index.php?action=history&amp;feed=atom&amp;title=Waiting%3AMulti-pass_Space_Complexity_for_Max-CUT"/>
	<link rel="alternate" type="text/html" href="https://sublinear.info/index.php?title=Waiting:Multi-pass_Space_Complexity_for_Max-CUT&amp;action=history"/>
	<updated>2026-06-06T20:48:52Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.31.10</generator>
	<entry>
		<id>https://sublinear.info/index.php?title=Waiting:Multi-pass_Space_Complexity_for_Max-CUT&amp;diff=1331&amp;oldid=prev</id>
		<title>Szhou: Created page with &quot;{{Header |title=Multi-pass Space Complexity for Max-CUT |source=WALDO 2021 |who=Santhoshini Velusamy }} Is the number of primes infinite? Note that if the answer is positive,...&quot;</title>
		<link rel="alternate" type="text/html" href="https://sublinear.info/index.php?title=Waiting:Multi-pass_Space_Complexity_for_Max-CUT&amp;diff=1331&amp;oldid=prev"/>
		<updated>2021-09-16T20:55:39Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;{{Header |title=Multi-pass Space Complexity for Max-CUT |source=WALDO 2021 |who=Santhoshini Velusamy }} Is the number of primes infinite? Note that if the answer is positive,...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{Header&lt;br /&gt;
|title=Multi-pass Space Complexity for Max-CUT&lt;br /&gt;
|source=WALDO 2021&lt;br /&gt;
|who=Santhoshini Velusamy&lt;br /&gt;
}}&lt;br /&gt;
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.&lt;/div&gt;</summary>
		<author><name>Szhou</name></author>
		
	</entry>
</feed>