Tag Archives: Hendrik Lenstra

Danny Nguyen and Igor Pak: Presburger Arithmetic Problem Solved!

Posted on March 22, 2019 by Gil Kalai

Short Presburger arithmetic is hard! This is a belated report on a remarkable breakthrough from 2017. The paper is Short Presburger arithmetic is hard, by Nguyen and Pak. Danny Nguyen Integer programming in bounded dimension: Lenstra’s Theorem Algorithmic tasks are … Continue reading →

Posted in Combinatorics, Computer Science and Optimization, Convex polytopes | Tagged Danny Nguyen, Frobenius coin problem, Hendrik Lenstra, Herb Scarf, Igor Pak, Kevin Woods, Persburger Arithmetic, Ravi Kannan, Sasha Barvinok | 2 Comments

	Peter Shor on The story of Poincaré and his…
	Gil Kalai on What do Firms Want?
	Gil Kalai on Noisy quantum circuits: how do…
	World News OK, WTF I… on Quantum computers: amazing pro…
	Quantum computers: a… on The story of Poincaré and his…
	Craig on The story of Poincaré and his…
	Gil Kalai on The story of Poincaré and his…
	Craig on The story of Poincaré and his…
	Rao on The story of Poincaré and his…
	Tom Copeland on Richard Ehrenborg’s prob…
	Marco Tomamichel on The story of Poincaré and his…
	Gil Kalai on The story of Poincaré and his…

Tag Archives: Hendrik Lenstra

Danny Nguyen and Igor Pak: Presburger Arithmetic Problem Solved!

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives