ACM Symposium on Theory of Computing, STOC 2017

Article Details
Title: Complexity of short Presburger arithmetic
Article URLs:
Alternative Article URLs:
Authors: Danny Nguyen
  • University of California - Los Angeles, Department of Mathematics
Igor Pak
  • University of California - Los Angeles, Department of Mathematics
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/stoc/NguyenP17
Author Comments:

Discuss this paper and its artifacts below