Recent Comments

Recent Posts
 An Improved Bound for Weak EpsilonNets in the Plane, by Nathan Rubin, is on the arXive
 ICM2018 First Report
 ICM 2018 at Rio, ICM Trivia Questions, the Sao Paulo General Assembly Meeting, and Other Excitements
 Building Bridges II, and Rio ICM 2018
 Test Your Intuition 35: What is the Limiting Distance?
 Beyond the gconjecture – algebraic combinatorics of cellular spaces I
 An Interview with Yisrael (Robert) Aumann
 Igor Pak is Giving the 2018 Erdős Lectures in Discrete Mathematics and Theoretical Computer Science
 Vera T. Sòs, Doctor Philisophiae Honoris Causa, Hebrew University of Jerusalem
Top Posts & Pages
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 An Improved Bound for Weak EpsilonNets in the Plane, by Nathan Rubin, is on the arXive
 ICM2018 First Report
 If Quantum Computers are not Possible Why are Classical Computers Possible?
 TYI 30: Expected number of Dice throws
 Nathan Rubin Improved the Bound for Planar Weak εNets and Other News From EinGedi
 Aaronson and Arkhipov's Result on Hierarchy Collapse
 Subhash Khot, Dor Minzer and Muli Safra completed the proof of the 2to2 Games Conjecture
 My Argument Against Quantum Computers: An Interview with Katia Moskvitch on Quanta Magazine
RSS
Advertisements