Imagen de Portada

The computational power of discrete chemical reaction networks with bounded executions

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Doty, David, Heckmann, Ben
Formato:	Preprint
Publicado:	2024
Materias:	Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Robust predicate and function computation in continuous chemical reaction networks
por: Calabrese, Kim, et al.
Publicado: (2025)

Analog computation with transcriptional networks
por: Doty, David, et al.
Publicado: (2025)

Reverse-Robust Computation with Chemical Reaction Networks
por: Kini, Ravi, et al.
Publicado: (2026)

On the computational power of $C$-random strings
por: Milovanov, Alexey
Publicado: (2024)

Limit on the computational power of $\mathrm{C}$-random strings
por: Milovanov, Alexey
Publicado: (2026)

On the power of counting the total number of computation paths of NPTMs
por: Bakali, Eleni, et al.
Publicado: (2023)

Oracle separation of QMA and QCMA with bounded adaptivity
por: Ben-David, Shalev, et al.
Publicado: (2024)

Bounding the computational power of bosonic systems
por: Upreti, Varun, et al.
Publicado: (2025)

On the complexity of freezing automata networks of bounded pathwidth
por: Goles, Eric, et al.
Publicado: (2025)

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

Stochastic thermodynamics of computation
por: Wolpert, David H.
Publicado: (2019)

Direct Product Theorems for Randomized Query Complexity
por: Ben-David, Shalev, et al.
Publicado: (2025)

Is stochastic thermodynamics the key to understanding the energy costs of computation?
por: Wolpert, David, et al.
Publicado: (2023)

Lower bounds for planar Arithmetic Circuits
por: Ramya, C., et al.
Publicado: (2025)

Negations are powerful even in small depth
por: Cavalar, Bruno, et al.
Publicado: (2025)

Exponential lower bound via exponential sums
por: Bhattacharjee, Somnath, et al.
Publicado: (2026)

Simple general magnification of circuit lower bounds
por: Atserias, Albert, et al.
Publicado: (2025)

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

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

The complexity of computing in continuous time: space complexity is precision
por: Blanc, Manon, et al.
Publicado: (2024)

Depth lower bounds in Stabbing Planes for combinatorial principles
por: Dantchev, Stefan, et al.
Publicado: (2021)

New Lower-bounds for Quantum Computation with Non-Collapsing Measurements
por: Miloschewsky, David, et al.
Publicado: (2024)

Rice-like complexity lower bounds for Boolean and uniform automata networks
por: Goubault-Larrecq, Aliénor, et al.
Publicado: (2024)

A computing machinery using a continuous memory tape
por: Oktar, Yigit
Publicado: (2023)

Man, these New York Times games are hard! A computational perspective
por: Alberti, Alessandro Giovanni, et al.
Publicado: (2025)

Fast polynomial computations with space constraints
por: Grenet, Bruno
Publicado: (2025)

A note on Jerabek's paper "A simplified lower bound for implicational logic"
por: Gordeev, Lev, et al.
Publicado: (2026)

Circuit metaconstruction in logspace for Rice-like complexity lower bounds in ANs and SGRs
por: Goubault-Larrecq, Aliénor, et al.
Publicado: (2025)

Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width
por: Razgon, Igor
Publicado: (2025)

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

A nearly-$4\log n$ depth lower bound for formulas with restriction on top
por: Wu, Hao
Publicado: (2024)

A Compendium of Reductions: reductions.network
por: Grüne, Christoph, et al.
Publicado: (2025)

Recursion and proof theoretical characterizations of small circuit classes with modulo counting via discrete differential equations (long version)
por: Antonelli, Melissa, et al.
Publicado: (2026)

On the power of adaption and randomization
por: Krieg, David, et al.
Publicado: (2024)

Oracle Separations for the Quantum-Classical Polynomial Hierarchy
por: Agarwal, Avantika, et al.
Publicado: (2024)

Separations in query complexity for total search problems
por: Ben-David, Shalev, et al.
Publicado: (2024)

Symmetric quantum computation
por: Castro-Silva, Davi, et al.
Publicado: (2025)

Minimum cost flow decomposition on arc-coloured networks
por: Neto, Claudio Carvalho, et al.
Publicado: (2025)

A linear bound for the size of the finite terminal assembly of a directed non-cooperative tile assembly system
por: Ivanov, Sergiu, et al.
Publicado: (2024)

$C_{2k+1}$-coloring of bounded-diameter graphs
por: Piecyk, Marta
Publicado: (2024)