scientific article; zbMATH DE number 7407776
From MaRDI portal
Publication:5155665
Igor Pak, Danny Nguyen, Philipp Hieronymi
Publication date: 8 October 2021
Full work available at URL: https://arxiv.org/abs/1805.03624
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- The complexity of logical theories
- NP-complete decision problems for binary quadratics
- A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
- Complexity of Presburger arithmetic with fixed quantifier dimension
- Ostrowski numeration systems, addition, and finite automata
- Integer optimization on convex semialgebraic sets
- When is scalar multiplication decidable?
- Small fast universal Turing machines
- EXPANSIONS OF THE ORDERED ADDITIVE GROUP OF REAL NUMBERS BY TWO DISCRETE SUBGROUPS
- Integer Programming with a Fixed Number of Variables
- Interpreting the projective hierarchy in expansions of the real line
- Complexity of Subcases of Presburger Arithmetic
- Expansions of dense linear orders with the intermediate value property
- The Complexity of Translating Logic to Finite Automata
- Finite Automata and the Analysis of Infinite Transition Systems
- Presburger arithmetic with bounded quantifier alternation
- Automata theory and its applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
