Polynomial-time Tractable Problems over the $p$-adic Numbers

Arno Fehm, Manuel Bodirsky

We study the computational complexity of fundamental problems over the $p$-adic numbers ${\mathbb{Q}}_p$ and the $p$-adic integers ${\mathbb{Z}}_p$. Guépin, Haase, and Worrell proved…