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, Peter Sarnak, Prime number theorem | 14 Comments

	vznvzn on Dan Romik on the Riemann zeta…
	Are Natural Mathemat… on An Invitation to a Conference:…
	Dan Romik on the Rie… on Dan Romik Studies the Riemann…
	Gil Kalai on Dan Romik Studies the Riemann…
	Matt Baker on Imre Bárány: Limit shape
	Itai Benjamini and J… on Hardness of Approximating Vert…
	Itai Benjamini and J… on Must-read book by Avi Wig…
	Gil Kalai on Hardness of Approximating Vert…
	Tools and Sensitivit… on Amazing: Hao Huang Proved the…
	La optimización de t… on A sensation in the morning new…
	Joseph Malkevitch on Imre Bárány: Limit shape
	Un matemático ruso d… on A sensation in the morning new…

Tag Archives: Peter Sarnak

The AC0 Prime Number Conjecture

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives