Memoryless computation: new results, constructions, and extensions

DOI10.1016/j.tcs.2014.09.040zbMath1303.68057arXiv1111.6026OpenAlexW2963235032MaRDI QIDQ476853

Søren Riis, Maximilien Gadouleau

Publication date: 2 December 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.6026

zbMATH Keywords

combinatoricssymmetric groupmodels of computationcomputational difficultymemoryless computationtheory of data

Mathematics Subject Classification ID

Related Items (6)

Synchronizing Boolean networks asynchronously ⋮ Attractor separation and signed cycles in asynchronous Boolean networks ⋮ Fixing monotone Boolean networks asynchronously ⋮ Complete simulation of automata networks ⋮ Sequentialization and procedural complexity in automata networks ⋮ On simulation in automata networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classical finite transformation semigroups. An introduction.
• Association schemes and t-designs in regular semilattices
• Closed iterative calculus
• Quadratic sequential computations of Boolean mappings
• Sequential computation of linear Boolean mappings
• Combinatorial representations
• Elementary decompositions of arbitrary maps over finite sets
• Mapping Computation with No Memory
• Coding for Errors and Erasures in Random Network Coding
• Generalized Connection Networks for Parallel Processor Intercommunication
• Network information flow
• Three generators for minimal writing-space computations
• Computing in permutation groups without memory
• Computing in matrix groups without memory
• Optimal Rearrangeable Multistage Connecting Networks

This page was built for publication: Memoryless computation: new results, constructions, and extensions