A New Characterization of FAC⁰ via Discrete Ordinary Differential Equations
Uložené v:
| Názov: | A New Characterization of FAC⁰ via Discrete Ordinary Differential Equations |
|---|---|
| Autori: | Antonelli, Melissa, Durand, Arnaud, Kontinen, Juha |
| Prispievatelia: | Department of Computer Science, Helsinki Institute for Information Technology, Department of Mathematics and Statistics, Melissa Antonelli and Arnaud Durand and Juha Kontinen |
| Informácie o vydavateľovi: | Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024. |
| Rok vydania: | 2024 |
| Predmety: | Small Circuit Classes, Discrete ODEs, Implicit computational complexity, Computer and information sciences, Implicit Computational Complexity, ordinary differential equations, ddc:004, parallel computation, Parallel Computation, circuit complexity |
| Popis: | Implicit computational complexity is an active area of theoretical computer science, which aims at providing machine-independent characterizations of relevant complexity classes. One of the seminal works in this field appeared in 1965, when Cobham introduced a function algebra closed under bounded recursion on notation to capture FP. Later on, several complexity classes have been characterized using limited recursion schemas. In this context, a new approach was recently introduced, showing that ordinary differential equations (ODEs) offer a natural tool for algorithmic design and providing a characterization of FP by an ODE-schema. The overall goal of the present work is precisely that of generalizing this approach to parallel computation, obtaining an original ODE-characterization for the small circuit classes FAC⁰ and FTC⁰. |
| Druh dokumentu: | Conference object Article |
| Popis súboru: | application/pdf |
| Jazyk: | English |
| DOI: | 10.4230/lipics.mfcs.2024.10 |
| Prístupová URL adresa: | http://hdl.handle.net/10138/585925 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.10 |
| Rights: | CC BY |
| Prístupové číslo: | edsair.dedup.wf.002..fa3ad1bb3a1bbd6ba9c0ec58f4c1f58b |
| Databáza: | OpenAIRE |
Nájsť tento článok vo Web of Science | Abstrakt: | Implicit computational complexity is an active area of theoretical computer science, which aims at providing machine-independent characterizations of relevant complexity classes. One of the seminal works in this field appeared in 1965, when Cobham introduced a function algebra closed under bounded recursion on notation to capture FP. Later on, several complexity classes have been characterized using limited recursion schemas. In this context, a new approach was recently introduced, showing that ordinary differential equations (ODEs) offer a natural tool for algorithmic design and providing a characterization of FP by an ODE-schema. The overall goal of the present work is precisely that of generalizing this approach to parallel computation, obtaining an original ODE-characterization for the small circuit classes FAC⁰ and FTC⁰. |
|---|---|
| DOI: | 10.4230/lipics.mfcs.2024.10 |