The reachability problem for finite cellular automata
type: Item
instance of: scholarly article
title: The reachability problem for finite cellular automata
zbMATH Open document ID: 0875.68660
DOI: 10.1016/0020-0190(94)00169-Y
author: Russell Impagliazzo
author: Andrea Clementi
published in: Information Processing Letters
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68Q80
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 986047
zbMATH Keywords: Computational complexity
zbMATH Keywords: Cellular automata
zbMATH Keywords: Reachability problems
zbMATH Keywords: Interactive proofs
MaRDI profile type: Publication
cites work: Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
cites work: Does co-NP have short interactive proofs ?
cites work: Q3805907
cites work: The Knowledge Complexity of Interactive Proof Systems
cites work: Q3793734
cites work: Exact results for deterministic cellular automata with additive rules
cites work: Q4273947
cites work: Algebraic properties of cellular automata
cites work: Q3358252
cites work: The complexity of reversible cellular automata
cites work: Invertible cellular automata: A review
cites work: Computation theory of cellular automata
description: scientific article; zbMATH DE number 986047