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

	JSE on Meeting Michael H. at Rio
	Quantum Future: Just… on Why Quantum Computers Cannot W…
	Anonymous on Amazing: Simpler and more gene…
	Generalizations of t… on Coloring Simple Polytopes and…
	CUT THE ❌crap❌ CONVE… on To Cheer You Up in Difficult T…
	RJLipton+KWRegan on What is mathematics (or at lea…
	Ferdinand Ihringer on Extremal Combinatorics VI: The…
	Jon Awbrey on What is mathematics (or at lea…
	Congrats Avi and Lac… on Cheerful News in Difficult Tim…
	Yiftach on Alef’s Corner
	Gil Kalai on Alef’s Corner
	Yiftach on Alef’s Corner

Tag Archives: Hendrik Lenstra

Danny Nguyen and Igor Pak: Presburger Arithmetic Problem Solved!

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives