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

	Equiangular lines wi… on Matan Harel, Frank Mousset, an…
	Equiangular lines wi… on The Combinatorics of Cocycles…
	aquazorcarson on Amazing: Hao Huang Proved the…
	Gil Kalai on Amazing: Hao Huang Proved the…
	aquazorcarson on Amazing: Hao Huang Proved the…
	Gil Kalai on Two Important Quantum Ann…
	adityaguharoy on Two Important Quantum Ann…
	aditya on Two Important Quantum Ann…
	Gil Kalai on Two Important Quantum Ann…
	aditya on Two Important Quantum Ann…
	Gil Kalai on Two Important Quantum Ann…
	Sonny Ben-Shimon on Two Important Quantum Ann…

Tag Archives: Hendrik Lenstra

Danny Nguyen and Igor Pak: Presburger Arithmetic Problem Solved!

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives