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

	Gil Kalai on TYI38 Lior Kalai: Monty Hall M…
	Answer to TYI 37: Ar… on Which Coalition to Form (…
	Answer to TYI 37: Ar… on Which Coalition?
	Answer to TYI 37: Ar… on Test Your Intuition (or simply…
	Yuval Peres on Answer to TYI 37: Arithmetic P…
	Gil Kalai on Henry Cohn, Abhinav Kumar, Ste…
	Gil Kalai on A sensation in the morning new…
	yaroslav shitov on A sensation in the morning new…
	Anon80 on A sensation in the morning new…
	Gil Kalai on A sensation in the morning new…
	dsp on A sensation in the morning new…
	The Hedetniemi’s con… on A sensation in the morning new…

Tag Archives: Hendrik Lenstra

Danny Nguyen and Igor Pak: Presburger Arithmetic Problem Solved!

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives