𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Elimination of Constants from Machines over Algebraically Closed Fields

✍ Scribed by Pascal Koiran

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

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Quantifier elimination for the theory of
Quantifier elimination for the theory of algebraically closed valued fields with analytic structure
✍ YalΔ±n F. Γ‡elikler πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 177 KB

## Abstract The theory of algebraically closed non‐Archimedean valued fields is proved to eliminate quantifiers in an analytic language similar to the one used by Cluckers, Lipshitz, and Robinson. The proof makes use of a uniform parameterized normalization theorem which is also proved in this pape

Diophantine Undecidability over Algebrai
Diophantine Undecidability over Algebraic Function Fields over Finite Fields of Constants
✍ Alexandra Shlapentokh πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 825 KB

We show that Diophantine problem (otherwise known as Hilbert's Tenth Problem) is undecidable over the fields of algebraic functions over the finite fields of constants of characteristic greater than two. This is the first example of Diophantine undecidability over any algebraic field. We also show t

Explicit Constructions of Perfect Hash F
Explicit Constructions of Perfect Hash Families from Algebraic Curves over Finite Fields
✍ Huaxiong Wang; Chaoping Xing πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 149 KB

Let A be a set of order n and B be a set of order m. An (n, m, w)-perfect hash family is a set H of functions from A to B such that for any X A with |X |=w, there exists an element h # H such that h is one-to-one when restricted to X. Perfect hash families have many applications to computer science,