Tag Archives: Irit Dinur

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

In And Around Combinatorics: The 18th Midrasha Mathematicae. Jerusalem, JANUARY 18-31

Posted on September 29, 2014 by

  The 18th yearly school in mathematics is devoted this year to combinatorics. It will feature lecture series by Irit Dinur, Joel Hass, Peter Keevash, Alexandru Nica, Alexander Postnikov, Wojciech Samotij, and David Streurer and additional activities. As usual grants … Continue reading →

Posted in Conferences, Updates | Tagged , , , , , , , | 1 Comment

Next Week in Jerusalem: Special Day on Quantum PCP, Quantum Codes, Simplicial Complexes and Locally Testable Codes

Posted on July 16, 2014 by

Special Quantum PCP and/or Quantum Codes: Simplicial Complexes and Locally Testable CodesDay בי”ס להנדסה ולמדעי המחשב 24 Jul 2014 – 09:30 to 17:00 room B-220, 2nd floor, Rothberg B Building On Thursday, the 24th of July we will host a SC-LTC (simplicial complexes … Continue reading →

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