Recent Comments

Recent Posts
 Ordinary computers can beat Google’s quantum computer after all
 Test Your Intuition 50. TwoPlayer Random Walk; Can You Detect Who Did Not Follow the Rules?
 ICM 2022. Kevin Buzzard: The Rise of Formalism in Mathematics
 ICM 2022: Langlands Day
 ICM 2022 awarding ceremonies (1)
 ICM 2022 Virtual Program, Live events, and Dynamics Week in Jerusalem
 Algorithmic Game Theory: Past, Present, and Future
 Richard Stanley: Enumerative and Algebraic Combinatorics in the1960’s and 1970’s
 Igor Pak: How I chose Enumerative Combinatorics
Top Posts & Pages
 Ordinary computers can beat Google’s quantum computer after all
 Test Your Intuition 50. TwoPlayer Random Walk; Can You Detect Who Did Not Follow the Rules?
 Amazing: Feng Pan and Pan Zhang Announced a Way to "Spoof" (Classically Simulate) the Google's Quantum Supremacy Circuit!
 ICM 2022. Kevin Buzzard: The Rise of Formalism in Mathematics
 The Argument Against Quantum Computers  A Very Short Introduction
 Gil's Collegial Quantum Supremacy Skepticism FAQ
 Quantum computers: amazing progress (Google & IBM), and extraordinary but probably false supremacy claims (Google).
 The story of Poincaré and his friend the baker
 Game Theory 2021
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