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)