Presburger arithmetic with algebraic scalar multiplications
From MaRDI portal
Publication:5155665
Authors: Philipp Hieronymi, Danny Nguyen, Igor Pak 
Publication date: 8 October 2021
Full work available at URL: https://arxiv.org/abs/1805.03624
Recommendations
Cites Work
- Integer Programming with a Fixed Number of Variables
- Title not available (Why is that?)
- NP-complete decision problems for binary quadratics
- A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
- Interpreting the projective hierarchy in expansions of the real line
- Finite Automata and the Analysis of Infinite Transition Systems
- Title not available (Why is that?)
- The complexity of generating functions for integer points in polyhedra and beyond
- The complexity of logical theories
- Automata theory and its applications
- Presburger arithmetic with bounded quantifier alternation
- Title not available (Why is that?)
- The Complexity of Translating Logic to Finite Automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Small fast universal Turing machines
- Expansions of dense linear orders with the intermediate value property
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complexity of Presburger arithmetic with fixed quantifier dimension
- Integer optimization on convex semialgebraic sets
- Complexity of Subcases of Presburger Arithmetic
- Title not available (Why is that?)
- Expansions of the ordered additive group of real numbers by two discrete subgroups
- Ostrowski numeration systems, addition, and finite automata
- When is scalar multiplication decidable?
Cited In (5)
This page was built for publication: Presburger arithmetic with algebraic scalar multiplications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5155665)
