The purpose of this letter is to investigate the time complexity consequences of the truncated Taylor series, known as Taylor Polynomials [bakas2019taylor, Katsoprinakis2011, Nestoridis2011]. In particular, it is demonstrated that the examination of the equality, is associated with the determination of whether the derivative of a particular solution is bounded or not. Accordingly, in some cases, this is not true, and hence in general.
1 Univariate complexity
Let the given problem is a known analytic function of one variable . Initially, the authors consider one-dimensional , and later they generalize the results. Respectively, the time complexity of the given problem, according to the literature [sipser2006introduction], may be written in the generic form of:
The execution time is usually calculated by some elementary algebraic operations of integers or real numbers [johnson1979computers], thus, this assumption is considered to be adequate and valid. Accordingly, the Taylor series expansion of at may be written by
with infinite terms, that is
where is the Taylor polynomial of order , and the remainder of the degree Taylor polynomial.
If the function is analytic, it has derivatives for each point in the interval . Moreover, if the derivatives for each point are in the interval , then, the Lagrangian form [kline1998calculus, apostol1967calculus] of the remainder may be expressed by:
This is subsequent of the explicit form of the remainder, stating that there exist a among , and , such that
If , the algorithm with complexity, runs in polynomial time.
If , cannot be expressed as polynomials.
By utilizing Borel’s theorem [narasimhan1985analysis], stating that any formal series is the Taylor series of a -smooth function defined in an open neighborhood of , it is derived that if is not bounded, cannot be written as a power series, and hence as a polynomial, thus the problem is not in . In other words, if the problem was in , it could be written as a polynomial, and this would be the Taylor series, which is absurd as no exist such that the is limited by a . ∎
2 Multiple dimensions
The given problem might have execution time depending on two or more variables , hence is is a function of a variable , that is
The above mentioned procedure may be applied to define if the complexity of the algorithm is polynomial, for each dimension , concerning the others as constants. If for one dimension is not a polynomial, then is not.
The presented analysis of computational time with Taylor series constitutes a basis for the investigation of whether a given complexity of is a polynomial or not.
3.1 Example of
In this simple case, one can easily observe that , which is not bounded by any for all .
and the series converges everywhere.
A variety of algorithms execute in times calculated by a number, raised to the power, for example the matrix chain multiplication via brute-force search is , a well as the lower bounds for the problem [impagliazzo2001problems]. In this case:
which is not bounded by any for all .
and the series converges everywhere.
E.g. the monotone circuits computing [alon1987monotone]. This is an example which though seems exponential, it is not verified if it indeed in not a polynomial (in contrast with 3.2.2).
Any monotone formula for the computation of a monotone function in NP must have size at least [razborov1990applications, robere2016exponential].
where is the natural logarithm, and hence,
and is the Pochhammer Symbol, with
Thus , never vanishes for . Additionally,
an hence the derivative of is not bounded. The alliterating sign results in for the limit of .
3.2 Examples of
This is a commonly resultant time (e.g. comparison sort).
which is , even for the second derivative ().
In this case, , and hence, the radius of convergence is required to be . For :
thus, it is obtained that:
P versus NP problem is to determine whether every problem whose solution can be verified in polynomial time, can be also solved in polynomial time [cook2006p]. In this letter, the authors highlighted that for a given complexity of for the solution of a problem, under certain criteria for a derivative of , , this problem cannot be considered as a polynomial. Furthermore, some specific problems, have known exponential lower bounds, e.g. [ukkonen1983exponential, kikot2012exponential, alon1987monotone, razborov1990applications, robere2016exponential]. In some of these cases, the derivative of is not bounded. Hence, in such cases, their solution can be quickly verified, in polynomial time, but on the other hand, by utilizing the aforementioned rationale, the lower bound of their solution cannot be expressed with a polynomial function of computational time, and hence cannot belong to class . Accordingly, the authors derive that in these cases (and hence in general), the proposed rationale, apart from distinguishing polynomial or not algorithms, based on existing lower bounds, might answer the question if
Taylor polynomial of order Order of the truncated polynomial, as well as the highest utilized derivative. number of variables for multidimensional problems. remainder of the degree Taylor polynomial polynomial of order integer , indicating the order of the problem. radius of convergence. [1cm]