The Lagrangian remainder of Taylor's series, distinguishes O(f(x)) time complexities to polynomials or not

01/30/2020
by   Nikolaos P. Bakas, et al.
0

The purpose of this letter is to investigate the time complexity consequences of the truncated Taylor series, known as Taylor Polynomials <cit.>. In particular, it is demonstrated that the examination of the P=NP equality, is associated with the determination of whether the n^th derivative of a particular solution is bounded or not. Accordingly, in some cases, this is not true, and hence in general.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/12/2018

Almost Global Problems in the LOCAL Model

The landscape of the distributed time complexity is nowadays well-unders...
research
02/06/2017

Fast multiplication for skew polynomials

We describe an algorithm for fast multiplication of skew polynomials. It...
research
07/13/2022

Balancing polynomials, Fibonacci numbers and some new series for π

We evaluate some types of infinite series with balancing and Lucas-balan...
research
04/07/2020

Finding polynomial roots by dynamical systems – a case study

We investigate two well known dynamical systems that are designed to fin...
research
05/19/2021

Recursion formulas for integrated products of Jacobi polynomials

From the literature it is known that orthogonal polynomials as the Jacob...
research
02/08/2023

A Unified Approach to Unimodality of Gaussian Polynomials

In 2013, Pak and Panova proved the strict unimodality property of q-bino...

Please sign up or login with your details

Forgot password? Click here to reset