Tag Archives: Frobenius coin problem

Danny Nguyen and Igor Pak: Presburger Arithmetic Problem Solved!

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 , , , , , , , , | 2 Comments