Category Archives: Computer Science and Optimization

Video of my ICM2018 lecture: Noise Stability, Noise Sensitivity, and the Quantum Computer Puzzle

Posted on September 21, 2018 by

The Video of my ICM2018 lecture is now on the air Here are the (slightly improved) slides. I made the mistake of trying to improve my slides in the evening before the lecture and in the morning I discovered that … Continue reading →

Posted in Combinatorics, Computer Science and Optimization, ICM2018, Quantum, Updates | Tagged | Leave a comment

Igor Pak is Giving the 2018 Erdős Lectures in Discrete Mathematics and Theoretical Computer Science

Posted on June 12, 2018 by

Update: The lectures this week are cancelled.  They will be given at a later date. Next week Igor Pak will give the 2018 Erdős Lectures   Monday Jun 18 2018 Combinatorics — Erdos lecture: Igor Pak (UCLA) “Counting linear extensions” 11:00am to 12:30pm Location: … Continue reading →

Posted in Combinatorics, Computer Science and Optimization, Geometry, Updates | Tagged | Leave a comment

Cohen, Haeupler, and Schulman: Explicit Binary Tree-Codes & Cancellations

Posted on April 24, 2018 by

The high-dimensional conference in Jerusalem is running with many exciting talks (and they are videotaped), and today in Tel Aviv there is a conference on Optimization and Discrete Geometry : Theory and Practice. Today in Jerusalem, Leonard Schulman talked (video available!) … Continue reading →

Posted in Combinatorics, Computer Science and Optimization, Open problems | Tagged , , , | 1 Comment

Conference on High Dimensional Combinatorics, April 22-26 2018

Posted on April 7, 2018 by

Conference on High Dimensional Combinatorics Conference home-page Dates: April 22-26, 2018 Place: Israel Institute for Advanced Studies, The Hebrew University of Jerusalem Organizers: Alex Lubotzky, Tali Kaufman and Oren Becker Registration form: click here Registration deadline: April 13, 2018 Combinatorics in general and the theory … Continue reading →

Posted in Combinatorics, Computer Science and Optimization, Conferences | Tagged , | 2 Comments

Monday February 19: Quantum Coding and High Dimensional Expanders

Posted on February 14, 2018 by

Tonight at 8:00 Israel time TCS+ Dor Misner on 2-to-2 games.    On Monday, February 19, we will have a special day on “Quantum Coding and High Dimensional Expanders” organized by Gilles Zemor. Sandwiches will be served for lunch, alongside … Continue reading →

Posted in Combinatorics, Computer Science and Optimization, Conferences, Quantum, Updates | Tagged , | 2 Comments

My Argument Against Quantum Computers: An Interview with Katia Moskvitch on Quanta Magazine

Posted on February 8, 2018 by

Quanta Magazine published an interview with me about quantum computers. It was a pleasure discussing this issue with Katia Moskvitch and I enjoyed also the photo session with David Vaaknin who also took a video of me explaining the importance of … Continue reading →

Posted in Computer Science and Optimization, Physics, Quantum | Tagged , , , , | 8 Comments

Akshay Venkatesh Lectures at HUJI – Ostrowski’s Prize Celebration, January 24&25

Posted on January 23, 2018 by

Thursday January 25, 14:15-15:45 Ostrowski’s prize ceremony and Akshay Venkatesh’s prize lecture: Period maps and Diophantine problems Followed by a Basic notion lecture by Frank Calegary 16:30-17:45: The cohomology of arithmetic groups and Langlands program Wednesday January 24, 18:00-17:00: Akshay Venkatesh … Continue reading →

Posted in Algebra and Number Theory, Computer Science and Optimization, Geometry, Updates | Tagged , , | Leave a comment

Hardness of Approximating Vertex Cover, Polytope-Integrality-Gap, the Alswede-Kachatrian theorem, and More.

Posted on January 21, 2018 by

Lior Silberman asked about applications of the 2-to-2 game theorem to hardness of approximation, and James Lee answered mentioning applications to vertex cover. Let me elaborate a little on vertex cover, and other matters. (Here is the pervious post on … Continue reading →

Posted in Combinatorics, Computer Science and Optimization | Tagged , , , , , , , | 1 Comment

Subhash Khot, Dor Minzer and Muli Safra completed the proof of the 2-to-2 Games Conjecture

Posted on January 10, 2018 by

Update: A related blog post by Boaz Barak: Unique Games Conjecture – halfway there? The 2-to-2 Games Conjecture is a somewhat weaker form of Khot’s unique game conjecture. The paper is: Pseudorandom Sets in Grassmann Graph have Near-Perfect Expansion by Subhash Khot, Dor … Continue reading →

Posted in Combinatorics, Computer Science and Optimization, Updates | Tagged , , | 8 Comments

Cody Murray and Ryan Williams’ new ACC breakthrough: Updates from Oded Goldreich’s Choices

Posted on January 8, 2018 by

Thanks to Irit Dinur for telling me about the following: Oded Goldreich’s recent choice is about the paper: Circuit Lower Bounds for Nondeterministic Quasi-Polytime: An Easy Witness Lemma for NP and NQP, by Corry Murray and Ryan Williams. Ryan Williams … Continue reading →

Posted in Combinatorics, Computer Science and Optimization, Updates | Tagged , , | 9 Comments