A parameterized satisfiability procedure yields a 3-EXPTIME upper bound for PresPower and an NEXPTIME bound for existential PresExp, improving prior non-elementary results.
The Complexity of Almost Linear Diophantine Problems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The complexity of Presburger arithmetic with power or powers
A parameterized satisfiability procedure yields a 3-EXPTIME upper bound for PresPower and an NEXPTIME bound for existential PresExp, improving prior non-elementary results.