Tag Archives: Sasha Barvinok

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

	구글의 양자컴퓨터 vs 고전 시뮬레이… on Gil’s Collegial Quantum…
	Gil Kalai on A small update from Israel and…
	Bee on When It Rains It Pours
	Gil Kalai on Or Ordentlich, Oded Regev and…
	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…

Tag Archives: Sasha Barvinok

Danny Nguyen and Igor Pak: Presburger Arithmetic Problem Solved!

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives