Short Presburger arithmetic is hard D Nguyen, I Pak SIAM Journal on Computing, 2019 | 19 | 2019 |
The computational complexity of integer programming with alternations D Nguyen, I Pak Mathematics of Operations Research 45 (1), 191-204, 2020 | 13 | 2020 |
Complexity of short Presburger arithmetic D Nguyen, I Pak Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 13 | 2017 |
Presburger Arithmetic with algebraic scalar multiplications P Hieronymi, D Nguyen, I Pak Logical Methods in Computer Science 17, 2021 | 9 | 2021 |
Complexity of short generating functions D Nguyen, I Pak Forum of Mathematics, Sigma 6, e1, 2018 | 6 | 2018 |
The inverse moment problem for convex polytopes: implementation aspects N Gravin, D Nguyen, D Pasechnik, S Robins arXiv preprint arXiv:1409.3130, 2014 | 6 | 2014 |
Parametric Presburger arithmetic: complexity of counting and quantifier elimination T Bogart, J Goodrick, D Nguyen, K Woods Mathematical Logic Quarterly 65 (2), 237-250, 2019 | 5 | 2019 |
Enumeration of integer points in projections of unbounded polyhedra D Nguyen, I Pak Integer Programming and Combinatorial Optimization: 19th International …, 2017 | 5 | 2017 |
On the number of integer points in translated and expanded polyhedra D Nguyen, I Pak Discrete & Computational Geometry, 1-20, 2020 | 4 | 2020 |
Tiling the integer lattice with translated sublattices M Borodzik, D Nguyen, S Robins Moscow Journal of Combinatorial Number Theory 6, 407–430, 2016 | 4 | 2016 |
Enumerating projections of integer points in unbounded polyhedra D Nguyen, I Pak SIAM Journal on Discrete Mathematics 32 (2), 986-1002, 2018 | 3 | 2018 |
VC-Dimensions of Short Presburger Formulas D Nguyen, I Pak Combinatorica 39, 923-932, 2019 | 1 | 2019 |
The Computational Complexity of Presburger Arithmetic D Nguyen Luu UCLA, 2018 | 1 | 2018 |
Solid angles associated to Minkowski reduced bases D Nguyen arXiv preprint arXiv:1206.4390, 2012 | | 2012 |