Reproduce “A new Lenstra-type Algorithm for Quasiconvex Polynomial Integer Minimization with Complexity 2^O(n log n)” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Robert Hildebrand, Matthias Köppe

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.