Copertina

The complexity of computing in continuous time: space complexity is precision

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Blanc, Manon, Bournez, Olivier
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Computational Complexity
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Measuring robustness of dynamical systems. Relating time and space to length and precision
di: Blanc, Manon, et al.
Pubblicazione: (2023)

Simulation of Turing machines with analytic discrete ODEs: FPTIME and FPSPACE over the reals characterised with discrete ordinary differential equations
di: Blanc, Manon, et al.
Pubblicazione: (2023)

Primitive Recursion without Composition: Dynamical Characterizations, from Neural Networks to Polynomial ODEs
di: Bournez, Olivier
Pubblicazione: (2026)

Relating the Computational and Logical Difficulty of Solving ODEs: From Polynomial to Discontinuous Right-Hand Sides
di: Bournez, Olivier, et al.
Pubblicazione: (2026)

Solvable Initial Value Problems Ruled by Discontinuous Ordinary Differential Equations
di: Bournez, Olivier, et al.
Pubblicazione: (2024)

Set Descriptive Complexity of Solvable Functions
di: Gozzi, Riccardo, et al.
Pubblicazione: (2024)

A universal bound on the space complexity of Directed Acyclic Graph computations
di: Bilardi, Gianfranco, et al.
Pubblicazione: (2024)

Unconventional complexity classes in unconventional computing (extended abstract)
di: Porreca, Antonio E.
Pubblicazione: (2024)

A new metric for evaluating the performance and complexity of computer programs: A new approach to the traditional ways of measuring the complexity of algorithms and estimating running times
di: Folea, Rares, et al.
Pubblicazione: (2025)

Quantum computational complexity of matrix functions
di: Cifuentes, Santiago, et al.
Pubblicazione: (2024)

Physical complexity and black hole quantum computers
di: Reilly, Michele, et al.
Pubblicazione: (2025)

Monitoring graph edges via shortest paths: computational complexity and approximation algorithms
di: Colli, Giordano
Pubblicazione: (2025)

On the complexity of computing Strahler numbers
di: Ganardi, Moses, et al.
Pubblicazione: (2025)

The complexity of convexity number and percolation time in the cycle convexity
di: Lima, Carlos V. G. C., et al.
Pubblicazione: (2024)

Correspondences in computational and dynamical complexity II: forcing complex reductions
di: Everett, Samuel
Pubblicazione: (2026)

The domino problem is decidable for robust tilesets
di: Aubrun, Nathalie, et al.
Pubblicazione: (2024)

On the complexity of Multipacking
di: Das, Sandip, et al.
Pubblicazione: (2026)

Reducing the complexity of computing the values of a Nash equilibrium
di: Chatterjee, Debtoru, et al.
Pubblicazione: (2025)

On one-way functions and the average time complexity of almost-optimal compression
di: Zimand, Marius
Pubblicazione: (2024)

Entropy of pebble automata and space complexity
di: Montoya, J. Andres
Pubblicazione: (2026)

Unambiguous parity-query complexity
di: Gavinsky, Dmytro
Pubblicazione: (2024)

Instance complexity of Boolean functions
di: Liu, Alison Hsiang-Hsuan, et al.
Pubblicazione: (2023)

On the quantum computational complexity of classical linear dynamics with geometrically local interactions: Dequantization and universality
di: Sakamoto, Kazuki, et al.
Pubblicazione: (2025)

A computing machinery using a continuous memory tape
di: Oktar, Yigit
Pubblicazione: (2023)

On complexity of restricted fragments of Decision DNNF
di: Calí, Andrea, et al.
Pubblicazione: (2025)

Between the deterministic and non-deterministic query complexity
di: Gerbner, Dániel
Pubblicazione: (2019)

On the complexity of embedding in graph products
di: Biedl, Therese, et al.
Pubblicazione: (2023)

Time hierarchies for sublogarithmic-space quantum computation
di: Say, A. C. Cem
Pubblicazione: (2025)

Relations between monotone complexity measures based on decision tree complexity
di: Byramji, Farzan, et al.
Pubblicazione: (2024)

Some structural complexity results for $\exists\mathbb R$
di: Meer, Klaus, et al.
Pubblicazione: (2025)

Parameterized complexity of scheduling unit-time jobs with generalized precedence constraints
di: Büsing, Christina, et al.
Pubblicazione: (2025)

Magic and communication complexity
di: Girish, Uma, et al.
Pubblicazione: (2025)

On the complexity of covering points by guillotine cuts
di: Garijo, Delia, et al.
Pubblicazione: (2026)

Proof complexity of Mal'tsev CSP
di: Gaysin, Azza
Pubblicazione: (2025)

Fast polynomial computations with space constraints
di: Grenet, Bruno
Pubblicazione: (2025)

Polynomial and analytic methods for classifying complexity of planar graph homomorphisms
di: Cai, Jin-Yi, et al.
Pubblicazione: (2024)

A primer on the closure of algebraic complexity classes under factoring
di: Bhargav, C. S., et al.
Pubblicazione: (2025)

Communication complexity of pointer chasing via the fixed-set lemma
di: Viola, Emanuele
Pubblicazione: (2025)

Half-duplex communication complexity with adversary can be less than the classical communication complexity
di: Dektiarev, Mikhail, et al.
Pubblicazione: (2024)

On a class of interdiction problems with partition matroids: complexity and polynomial-time algorithms
di: Ketkov, Sergey S., et al.
Pubblicazione: (2024)