Short Presburger arithmetic is hard

DOI10.1109/FOCS.2017.13MaRDI QIDQ6946375zbMATH OpenFDO

Authors Danny Nguyen, Igor Pak

Publication date 6 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2017.13

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

This page was built for publication: Short Presburger arithmetic is hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6946375)