Imagen de Portada

Complexity Theory meets Ordinary Differential Equations

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Fono, Adalbert, Wedlich, Noah, Boche, Holger, Kutyniok, Gitta
Formato:	Preprint
Publicado:	2026
Materias:	Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Mathematical Algorithm Design for Deep Learning under Societal and Judicial Constraints: The Algorithmic Transparency Requirement
por: Boche, Holger, et al.
Publicado: (2024)

Computability of Classification and Deep Learning: From Theoretical Limits to Practical Feasibility through Quantization
por: Boche, Holger, et al.
Publicado: (2024)

Turing meets Moore-Penrose: Computing the Pseudoinverse on Turing Machines
por: Boche, Holger, et al.
Publicado: (2022)

Inverse Problems Are Solvable on Real Number Signal Processing Hardware
por: Boche, Holger, et al.
Publicado: (2022)

Expressivity of Spiking Neural Networks
por: Singh, Manjot, et al.
Publicado: (2023)

Sustainable AI: Mathematical Foundations of Spiking Neural Networks
por: Fono, Adalbert, et al.
Publicado: (2025)

Time to Spike? Understanding the Representational Power of Spiking Neural Networks in Discrete Time
por: Nguyen, Duc Anh, et al.
Publicado: (2025)

Symbolic Recovery of Differential Equations: The Identifiability Problem
por: Scholl, Philipp, et al.
Publicado: (2022)

Arithmetic Complexity of Solutions of the Dirichlet Problem
por: Boche, Holger, et al.
Publicado: (2026)

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

The Price of Robustness: Stable Classifiers Need Overparameterization
por: von Berg, Jonas, et al.
Publicado: (2026)

Characterizing Small Circuit Classes from FAC^0 to FAC^1 via Discrete Ordinary Differential Equations
por: Antonelli, Melissa, et al.
Publicado: (2025)

Iterative Optimization of Multidimensional Functions on Turing Machines under Performance Guarantees
por: Boche, Holger, et al.
Publicado: (2025)

A Variational Framework for the Algorithmic Complexity of PDE Solutions
por: Cardona, Juan Esteban Suarez, et al.
Publicado: (2025)

Towards New Characterizations of Small Circuit Classes via Discrete Ordinary Differential Equations
por: Antonelli, Melissa, et al.
Publicado: (2025)

Systems of Discrete Differential Equations, Constructive Algebraicity of the Solutions
por: Notarantonio, Hadrien, et al.
Publicado: (2023)

Assembly Theory and its Relationship with Computational Complexity
por: Kempes, Christopher P., et al.
Publicado: (2024)

An Overview of the Theory of Instances Computational Complexity
por: Jorge A. Ruiz-Vanoye
Publicado: (2011)

Second-Order Parameterizations for the Complexity Theory of Integrable Functions
por: Bacho, Aras, et al.
Publicado: (2025)

Complexity Theory for Quantum Promise Problems
por: Chia, Nai-Hui, et al.
Publicado: (2024)

Solving Polynomial Equations Over Finite Fields
por: Dell, Holger, et al.
Publicado: (2024)

Low-soundness direct-product testers and PCPs from Kaufman--Oppenheim complexes
por: O'Donnell, Ryan, et al.
Publicado: (2025)

Meta-Mathematics of Computational Complexity Theory
por: Oliveira, Igor C.
Publicado: (2025)

Streaming Complexity Separations for Dense and Sparse Graphs
por: Liu, Yang P., et al.
Publicado: (2026)

BQP, meet NP: Search-to-decision reductions and approximate counting
por: Gharibian, Sevag, et al.
Publicado: (2024)

Separations above TFNP from Sherali-Adams Lower Bounds
por: Fleming, Noah, et al.
Publicado: (2026)

The Complexity of Counting Small Sub-Hypergraphs
por: Bressan, Marco, et al.
Publicado: (2025)

Structure in Communication Complexity and Constant-Cost Complexity Classes
por: Hatami, Hamed, et al.
Publicado: (2024)

Fast Matrix Multiplication meets the Submodular Width
por: Abo-Khamis, Mahmoud, et al.
Publicado: (2024)

Equations over Finite Monoids with Infinite Promises
por: Larrauri, Alberto, et al.
Publicado: (2025)

From Proof Complexity to Circuit Complexity via Interactive Protocols
por: Arteche, Noel, et al.
Publicado: (2024)

Linear Equations with Min and Max Operators: Computational Complexity
por: Chatterjee, Krishnendu, et al.
Publicado: (2024)

Complex Boolean Turing Machines: An Algebraic Semantic Framework for Computational Complexity
por: Zheng, Bojin, et al.
Publicado: (2026)

Information-Based Complexity vs Computational Complexity in Phaseless Polynomial Interpolation
por: Przybyłek, Michał R., et al.
Publicado: (2026)

The Complexity of Tensor Rank
por: Schaefer, Marcus, et al.
Publicado: (2016)

Pseudodeterministic Communication Complexity
por: Göös, Mika, et al.
Publicado: (2025)

Query Complexity with Unknowns
por: Mande, Nikhil S., et al.
Publicado: (2024)

On Condensation of Block Sensitivity, Certificate Complexity and the $\mathsf{AND}$ (and $\mathsf{OR}$) Decision Tree Complexity
por: Nalli, Sai Soumya, et al.
Publicado: (2026)

The Radical Solution and Computational Complexity
por: Zheng, Bojin, et al.
Publicado: (2024)

The Computational Complexity of Factored Graphs
por: Gupta, Shreya, et al.
Publicado: (2024)