Recent Comments

Recent Posts
 Game Theory – online Course at IDC, Herzliya
 TYI44: “What Then, To Raise an Old Question, is Mathematics?”
 Kelman, Kindler, Lifshitz, Minzer, and Safra: Towards the EntropyInfluence Conjecture
 Or Ordentlich, Oded Regev and Barak Weiss: New bounds for Covering Density!
 To cheer you up in complicated times – A book proof by Rom Pinchasi and Alexandr Polyanskii for a 1978 Conjecture by Erdős and Purdy!
 A new PolyTCS blog!
 Remarkable New Stochastic Methods in ABF: Ronen Eldan and Renan Gross Found a New Proof for KKL and Settled a Conjecture by Talagrand
 Hoi Nguyen and Melanie Wood: Remarkable Formulas for the Probability that Projections of Lattices are Surjective
 Petra! Jordan!
Top Posts & Pages
 Game Theory  online Course at IDC, Herzliya
 TYI44: "What Then, To Raise an Old Question, is Mathematics?"
 Kelman, Kindler, Lifshitz, Minzer, and Safra: Towards the EntropyInfluence Conjecture
 TYI 30: Expected number of Dice throws
 To cheer you up in complicated times  A book proof by Rom Pinchasi and Alexandr Polyanskii for a 1978 Conjecture by Erdős and Purdy!
 When Do a Few Colors Suffice?
 A sensation in the morning news  Yaroslav Shitov: Counterexamples to Hedetniemi's conjecture.
 The seventeen camels riddle, and Noga Alon's camel proof and algorithms
 Quantum computers: amazing progress (Google & IBM), and extraordinary but probably false supremacy claims (Google).
RSS
Monthly Archives: January 2011
IPAM remote blogging: The Many Facets of Linear Programming
The many facets of Linear Programming Here is an extremely nice paper by Michael Todd from 2001. It gives useful background for many lectures and it can serve as a good base point to examine last decade’s progress. Background post for … Continue reading
Günter Ziegler: 1000$ from Beverly Hills for a Math Problem. (IPAM remote blogging.)
Scanned letter by Zadeh. (c) Günter M. Ziegler lefttoright: David Avis, Norman Zadeh, Oliver Friedmann, and Russ Caflish (IPAM director). Photo courtesy Eddie Kim. Update: The slides for Friedmann’s talk are now available. The conference schedule page contains now the slides for … Continue reading
Posted in Computer Science and Optimization, Conferences, Guest blogger
Tagged Linear programming
4 Comments
IPAM Remote Blogging: SantosWeibel 25Vertices Prismatoid and Prismatoids with large Width
Here is a web page by Christope Weibel on the improved counterexample. The IPAM webpage contains now slides of some of the lectures. Here are Santos’s slides. The last section contains some recent results on the “width of 5prismatoids” A prismatoid is a polytope … Continue reading
Remote Blogging: Efficiency of the Simplex Method: Quo vadis Hirsch conjecture?
Here are some links and posts related to some of the talks in IPAM’s workshop “Efficiency of the Simplex Method: Quo vadis Hirsch conjecture?” I will be happy to add links to pdf’s of the presentations and to relevant papers. Descriptions and … Continue reading
Is Backgammon in P?
The Complexity of ZeroSum Stochastic Games with Perfect Information Is there a polynomial time algorithm for chess? Well, if we consider the complexity of chess in terms of the board size then it is fair to think that the answer is … Continue reading
To Life, to Science and to Innovations
ICS2011 at ITCS, Tsinghua University, Beijing, China The title of this post “To life, to Science and to Innovations” was Silvio Micali’s toast at the second conference on Innovations in Computer Science and Silvio’s words have a good chance of becomeing the official toast of … Continue reading