Monthly Archives: January 2011

IPAM remote blogging: The Many Facets of Linear Programming

Posted on January 20, 2011 by Gil Kalai

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 →

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

Günter Ziegler: 1000$ from Beverly Hills for a Math Problem. (IPAM remote blogging.)

Posted on January 20, 2011 by Gil Kalai

Scanned letter by Zadeh. (c) Günter M. Ziegler left-to-right: 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 | 4 Comments

IPAM Remote Blogging: Santos-Weibel 25-Vertices Prismatoid and Prismatoids with large Width

Posted on January 20, 2011 by Gil Kalai

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 5-prismatoids”  A prismatoid is a polytope … Continue reading →

Posted in Computer Science and Optimization, Conferences, Convex polytopes | 2 Comments

Remote Blogging: Efficiency of the Simplex Method: Quo vadis Hirsch conjecture?

Posted on January 18, 2011 by Gil Kalai

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 →

Posted in Computer Science and Optimization, Conferences, Convex polytopes | 4 Comments

Is Backgammon in P?

Posted on January 14, 2011 by Gil Kalai

  The Complexity of Zero-Sum 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 →

Posted in Computer Science and Optimization, Games, Open problems, Probability | 10 Comments

To Life, to Science and to Innovations

Posted on January 14, 2011 by Gil Kalai

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 →

Posted in Computer Science and Optimization, Conferences | 7 Comments