Rate-independent computation in continuous chemical reaction networks
From MaRDI portal
Publication:2988890
DOI10.1145/2554797.2554827zbMath1364.68194arXiv2107.13681OpenAlexW3186571578MaRDI QIDQ2988890
David Soloveichik, Ho-Lin Chen, David Doty
Publication date: 19 May 2017
Published in: Proceedings of the 5th conference on Innovations in theoretical computer science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.13681
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Classical flows, reactions, etc. in chemistry (92E20)
Related Items
Democratic, existential, and consensus-based output conventions in stable computation by chemical reaction networks, Chemical reaction network designs for asynchronous logic circuits, Verifying chemical reaction network implementations: a bisimulation approach, Computing with chemical reaction networks: a tutorial, Fridge compiler: optimal circuits from molecular inventories, Unnamed Item, Unnamed Item, Computational Complexity of Atomic Chemical Reaction Networks, Leaderless deterministic chemical reaction networks, Verifying polymer reaction networks using bisimulation, Reachability Problems for Continuous Chemical Reaction Networks, Minimal output unstable configurations in chemical reaction networks and deciders, Chemical Reaction Network Designs for Asynchronous Logic Circuits, A Survey on Analog Models of Computation
Cites Work
- Unnamed Item
- A hierarchy of polynomial time lattice basis reduction algorithms
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Trapdoors for hard lattices and new cryptographic constructions
- Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
- Evaluating Branching Programs on Encrypted Data
- Bounds for Width Two Branching Programs
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- New lattice-based cryptographic constructions
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
