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...
Κύριοι συγγραφείς: | Guépin, F, Haase, C, Worrell, J |
---|---|
Μορφή: | Conference item |
Έκδοση: |
IEEE
2019
|
Παρόμοια τεκμήρια
-
On the expressiveness of Büchi arithmetic
ανά: Haase, C, κ.ά.
Έκδοση: (2021) -
On deciding linear arithmetic constraints over -adic integers for all primes
ανά: Haase, C, κ.ά.
Έκδοση: (2021) -
Rational number arithmetic by Parallel P-adic Algorithms /
ανά: 284588 Limongeli, Carla, κ.ά. -
Almost Linear Büchi Automata
ανά: Tomáš Babiak, κ.ά.
Έκδοση: (2009-11-01) -
Markov chains and unambiguous Büchi automata
ανά: Baier, C, κ.ά.
Έκδοση: (2016)