Journal of Symbolic Logic 65 (4):1675-1685 (2000)

Abstract
Let f be a function from N to N that can not be computed in polynomial time, and let a be an element of a differential field K of characteristic 0. The problem of large powers is the set of tuples $\bar{x} = $ of K so that $x_1 = a^{f}$, and the problem of large roots is the set of tuples $\bar{x}$ of K so that $x^{f}_1 = a$. These are two examples of problems that the use of derivation does not allow to solve quicker. We show that the problem of large roots is not polynomial for the differential field K, even if we use a polynomial number of parameters, and that the problem of large powers is not polynomial for the differential field K, even for non-uniform complexity. The proofs use the polynomial stability of field of characteristic 0, shown by L. Blum. F. Cucker. M. Shub and S. Smale, and the reduction lemma, that transforms a differential polynomial in variables $\bar{x}$ into a polynomial in variables $\bar{x}$. and their derivatives.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI http://projecteuclid.org/euclid.jsl/1183746256
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Translate to english
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 53,066
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Polynomial Time Uniform Word Problems.Stanley Burris - 1995 - Mathematical Logic Quarterly 41 (2):173-182.
Stabilité Polynômiale Des Corps Différentiels.Natacha Portier - 1999 - Journal of Symbolic Logic 64 (2):803-816.
Stabilite Polynomiale des Corps Differentiels.Natacha Portier - 1999 - Journal of Symbolic Logic 64 (2):803-816.
Light Affine Lambda Calculus and Polynomial Time Strong Normalization.Kazushige Terui - 2007 - Archive for Mathematical Logic 46 (3-4):253-280.
Feasible Graphs and Colorings.Douglas Cenzer & Jeffrey Remmel - 1995 - Mathematical Logic Quarterly 41 (3):327-352.
Polynomial Games and Determinacy.Tomoyuki Yamakami - 1996 - Annals of Pure and Applied Logic 80 (1):1-16.
Polynomial-Time Abelian Groups.Douglas Cenzer & Jeffrey Remmel - 1992 - Annals of Pure and Applied Logic 56 (1-3):313-363.
Structural Complexity Of.Dmitry Itsykson - 2010 - Annals of Pure and Applied Logic 162 (3):213-223.
On Nondeterminism, Enumeration Reducibility and Polynomial Bounds.Kate Copestake - 1997 - Mathematical Logic Quarterly 43 (3):287-310.
Polynomial Stability of Differential Fields.N. Portier - 1999 - Journal of Symbolic Logic 64 (2):803-816.

Analytics

Added to PP index
2017-02-21

Total views
0

Recent downloads (6 months)
0

How can I increase my downloads?

Downloads

Sorry, there are not enough data points to plot this chart.

My notes