On the existential theories of Büchi arithmetic and linear p-adic fields
We consider the complexity of the satisfiability problems for the existential fragment of Büchi arithmetic and for the existential fragment of linear arithmetic over p-adic fields. Our main results are that both problems are NP-complete. The NP upper bound for existential linear arithmetic over p-ad...
Prif Awduron: | Guépin, F, Haase, C, Worrell, J |
---|---|
Fformat: | Conference item |
Cyhoeddwyd: |
IEEE
2019
|
Eitemau Tebyg
-
On the expressiveness of Büchi arithmetic
gan: Haase, C, et al.
Cyhoeddwyd: (2021) -
On deciding linear arithmetic constraints over -adic integers for all primes
gan: Haase, C, et al.
Cyhoeddwyd: (2021) -
Rational number arithmetic by Parallel P-adic Algorithms /
gan: 284588 Limongeli, Carla, et al. -
Almost Linear Büchi Automata
gan: Tomáš Babiak, et al.
Cyhoeddwyd: (2009-11-01) -
Markov chains and unambiguous Büchi automata
gan: Baier, C, et al.
Cyhoeddwyd: (2016)