Name
Abstract | ||
|---|---|---|
This paper presents a detailed analysis of a quantifier elimination algorithm for the first order theory of p-adic numbers based on a p-adic analogue of the cylindrical algebraic decomposition. It is believed that this method should lead to an elementary upper bound for the theory. The present paper gives strong arguments against this conjecture and offers a basis for further speculation. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1007/s000370050011 | Computational Complexity |
Keywords | Field | DocType |
cylindrical algebraic decomposition,quantifier elimination,upper bound,first order | Quantifier elimination,Discrete mathematics,Combinatorics,First order theory,Elimination theory,Upper and lower bounds,p-adic number,Conjecture,Cylindrical algebraic decomposition,Mathematics | Journal |
Volume | Issue | ISSN |
7 | 3 | 1016-3328 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lavinia Egidi | 1 | 91 | 10.21 |