activity
20202026
most citedA distributed, plug-n-play algorithm for multi-robot applications with a priori non-computable objective functions

31 citations · 42 across the 6 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2020

The Lagrangian remainder of Taylor's series, distinguishes time complexities to polynomials or not

Nikolaos P. Bakas, Elias Kosmatopoulos, Mihalis Nicolaou +1

The purpose of this letter is to investigate the time complexity consequences of the truncated Taylor series, known as Taylor Polynomials \cite{bakas2019taylor,Katsoprinakis2011,Ne…