Modeling and analysis of novel COVID-19 outbreak under fractal-fractional derivative in Caputo sense with power-law: a case study of Pakistan
In this paper, a five-compartment model is used to explore the dynamics of the COVID-19
pandemic, taking the vaccination campaign into account. The present model consists of five …
pandemic, taking the vaccination campaign into account. The present model consists of five …
A characterisation of functions computable in polynomial time and space over the reals with discrete ordinary differential equations: Simulation of Turing machines …
We prove that functions over the reals computable in polynomial time can be characterised
using discrete ordinary differential equations (ODE), also known as finite differences. We …
using discrete ordinary differential equations (ODE), also known as finite differences. We …
A New Characterization of FAC⁰ via Discrete Ordinary Differential Equations
M Antonelli, A Durand, J Kontinen - … International Symposium on …, 2024 - drops.dagstuhl.de
Implicit computational complexity is an active area of theoretical computer science, which
aims at providing machine-independent characterizations of relevant complexity classes …
aims at providing machine-independent characterizations of relevant complexity classes …
Simulation of Turing machines with analytic discrete ODEs: FPTIME and FPSPACE over the reals characterised with discrete ordinary differential equations
We prove that functions over the reals computable in polynomial time can be characterised
using discrete ordinary differential equations (ODE), also known as finite differences. We …
using discrete ordinary differential equations (ODE), also known as finite differences. We …
The complexity of computing in continuous time: space complexity is precision
Models of computations over the integers are equivalent from a computability and
complexity theory point of view by the Church-Turing thesis. It is not possible to unify discrete …
complexity theory point of view by the Church-Turing thesis. It is not possible to unify discrete …
Polynomial time computable functions over the reals characterized using discrete ordinary differential equations
The class of functions from the integers to the integers computable in polynomial time has
been characterized recently using discrete ordinary differential equations (ODE), also known …
been characterized recently using discrete ordinary differential equations (ODE), also known …
Towards New Characterizations of Small Circuit Classes via Discrete Ordinary Differential Equations (short paper)
M Antonelli, A Durand… - 25th Italian Conference …, 2024 - researchportal.helsinki.fi
Implicit computational complexity is an active area of theoretical computer science, which
aims to provide machine-independent characterizations of relevant complexity classes. One …
aims to provide machine-independent characterizations of relevant complexity classes. One …
[PDF][PDF] Characterisations of polynomial-time and-space complexity classes over the reals
Many recent works study how analogue models work, compared to classical digital ones
([6]). By “analogue” models of computation, we mean computing over continuous quantities …
([6]). By “analogue” models of computation, we mean computing over continuous quantities …
[PDF][PDF] Towards New Characterizations of Small Circuit Classes via Discrete Ordinary Differential Equations
M Antonelli, A Durand, J Kontinen - 2022 - ictcs2024.di.unito.it
Implicit computational complexity is an active area of theoretical computer science, which
aims to provide machine-independent characterizations of relevant complexity classes. One …
aims to provide machine-independent characterizations of relevant complexity classes. One …