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

	Ali on To cheer you up in difficult t…
	Gll Better – M… on My Quantum Debate with Aram Ha…
	Gil Kalai on To cheer you up in difficult t…
	Gil Kalai on To cheer you up in difficult t…
	Vijay Vazirani on To cheer you up in difficult t…
	wdjoyner on To cheer you up in difficult t…
	Gil Kalai on To cheer you up in difficult t…
	John Baez on To cheer you up in difficult t…
	Gil Kalai on TYI44: “What Then, To Ra…
	Shai Deshe on TYI44: “What Then, To Ra…
	To cheer you up in d… on Updates (belated) Between New…
	To cheer you up in d… on The AC0 Prime Number Conj…

Tag Archives: Hendrik Lenstra

Danny Nguyen and Igor Pak: Presburger Arithmetic Problem Solved!

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives