Tag Archives: Peter Sarnak

The AC0 Prime Number Conjecture

Posted on February 21, 2011 by Gil Kalai

Möbius randomness and computational complexity Last spring Peter Sarnak gave a thought-provoking lecture in Jerusalem. (Here are the very interesting slides of a similar lecture at I.A.S.) Here is a variation of the type of questions Peter has raised. The Prime … Continue reading →

Posted in Computer Science and Optimization, Number theory | Tagged Analytic number theory, Ben Green, Bounded depth circuits, Circuit complexity, Jean Bourgain, Mathoverflow, Peter Sarnak, Prime number theorem | 14 Comments

	Gil Kalai on Gérard Cornuéjols’s bake…
	Abstractness on Amazing: Karim Adiprasito prov…
	Gil Kalai on The story of Poincaré and his…
	Peter Shor on The story of Poincaré and his…
	Gil Kalai on What do Firms Want?
	Gil Kalai on Noisy quantum circuits: how do…
	World News OK, WTF I… on Quantum computers: amazing pro…
	Quantum computers: a… on The story of Poincaré and his…
	Craig on The story of Poincaré and his…
	Gil Kalai on The story of Poincaré and his…
	Craig on The story of Poincaré and his…
	Rao on The story of Poincaré and his…

Tag Archives: Peter Sarnak

The AC0 Prime Number Conjecture

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives