𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computational Complexity over thep-adic Numbers

✍ Scribed by Michael Maller; Jennifer Whitehead

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
351 KB
Volume
13
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Group Ring ofSL2(p2) over thep-adic
The Group Ring ofSL2(p2) over thep-adic Integers
✍ Gabriele Nebe πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 174 KB

This paper describes the ring-theoretic structure of the group rings of SL p 2 over the p-adic integers.

P≠NC over the p-adic numbers
P≠NC over the p-adic numbers
✍ Michael Maller; Jennifer Whitehead πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 130 KB

We show that in the Blum-Shub-Smale model of computation, over the p-adic numbers Q p ; the class NC Q p is strictly contained in the class P Q p : That is, there exist sets of p-adic numbers which can be recognized in sequential polynomial time, but which cannot be recognized in polylogarithmic par

Computational complexity of quantifier-f
Computational complexity of quantifier-free negationless theory of field of rational numbers
✍ Nikolai Kossovski πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 70 KB

The following result is an approximation to the answer of the question of Kokorin (Logical Notebook, Unsolved Problems of Mathematics, Novosibirsk, 1986, 41pp; in Russian) about decidability of a quantiΓΏer-free theory of ΓΏeld of rational numbers. Let Q0 be a subset of the set of all rational numbers