:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Kini, Ravi, Doty, David
Format:	Preprint
Published:	2026
Subjects:	Computational Complexity
Online Access:	https://arxiv.org/abs/2604.14355
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The computational power of discrete chemical reaction networks with bounded executions
by: Doty, David, et al.
Published: (2024)

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

Analog computation with transcriptional networks
by: Doty, David, et al.
Published: (2025)

On the Simulation Power of Surface Chemical Reaction Networks
by: Lee, Yi-Xuan, et al.
Published: (2024)

Reversible Computation with Stacks and "Reversible Management of Failures"
by: Palazzo, Matteo, et al.
Published: (2025)

Reachability with Restricted Reactions in Inhibitory Chemical Reaction Networks
by: Bajaj, Divya, et al.
Published: (2026)

Polynomial Equivalence of Extended Chemical Reaction Models
by: Bajaj, Divya, et al.
Published: (2025)

Computational Complexity of UAP Reverse Engineering: A Formal Analysis of Automaton Identification and Data Complexity
by: Daghbouche, Karim
Published: (2025)

Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse
by: Jackiewicz, Marcel, et al.
Published: (2024)

When Majority Fails: Tight Bounds for Correlation Distillation Conjectures
by: Kamath, Pritish, et al.
Published: (2026)

Understanding Robust Catalytic Computing
by: Koucký, Michal, et al.
Published: (2026)

On Computability of Computable Problems
by: Khaliq, Asad
Published: (2023)

Equivalence of Countable and Computable
by: Zhang, Hantao
Published: (2024)

Almost-catalytic Computation
by: Bisoyi, Sagar, et al.
Published: (2024)

Lossy Catalytic Computation
by: Gupta, Chetan, et al.
Published: (2024)

Modifications of Quantum Computation and Adaptive Queries to PP
by: Miloschewsky, David, et al.
Published: (2025)

Faster Mixing of Higher-Dimensional Random Reversible Circuits
by: Gay, William, et al.
Published: (2024)

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

The Complexity of Iterated Reversible Computation
by: Eppstein, David
Published: (2021)

Chemically Motivated Simulation Problems are Efficiently Solvable by a Quantum Computer
by: Schleich, Philipp, et al.
Published: (2024)

Computational Complexities of Folding
by: Eppstein, David
Published: (2024)

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

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

Random Permutations in Computational Complexity
by: Hitchcock, John M., et al.
Published: (2025)

Chernoff Bounds and Reverse Hypercontractivity on HDX
by: Dikstein, Yotam, et al.
Published: (2024)

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

Towards a Characterization of Two-way Bijections in a Reversible Computational Model
by: Palazzo, Matteo, et al.
Published: (2025)

Computational Complexity of Game Boy Games
by: Tirmazi, Hayder, et al.
Published: (2024)

Hard-to-Sample Distributions from Robust Extractors
by: Byramji, Farzan, et al.
Published: (2026)

Pseudorandom Permutations from Random Reversible Circuits
by: He, William, et al.
Published: (2024)

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

The Parameterized Complexity of Computing the Linear Vertex Arboricity
by: Erhardt, Alexander, et al.
Published: (2025)

Computing the Elementary Symmetric Polynomials in Positive Characteristics
by: Orzel, Ian
Published: (2025)

Topics in Theoretical Computer Science
by: Rode, Alexander Forrest
Published: (2025)

Computational Complexity and Integer Programming Formulation of the Oredango Puzzle
by: Takahata, Takuma, et al.
Published: (2025)

Scheme-Theoretic Approach to Computational Complexity. III. SETH
by: Çivril, Ali
Published: (2023)

On the Complexity of Discounted Robust MDPs with $L_p$ Uncertainty Sets
by: Asadi, Ali, et al.
Published: (2026)

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

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

A Smoothed Analysis of the Space Complexity of Computing a Chaotic Sequence
by: Okada, Naoaki, et al.
Published: (2024)