Predicting nonlinear cellular automata quickly by decomposing them into linear ones (Q1376426): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3127470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuits and expressions with nonassociative gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Attractor vicinity decay for a cellular automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation theoretic aspects of cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On pseudovarieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity, circuits, and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solvability and quasiperiodicity of one-dimensional cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3212314 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of generating random fractals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic properties of cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4022642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3926778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics of cellular automata / rank
 
Normal rank

Latest revision as of 09:00, 28 May 2024

scientific article
Language Label Description Also known as
English
Predicting nonlinear cellular automata quickly by decomposing them into linear ones
scientific article

    Statements

    Predicting nonlinear cellular automata quickly by decomposing them into linear ones (English)
    0 references
    0 references
    17 December 1997
    0 references
    cellular automata decomposition
    0 references
    parallel computing
    0 references
    group theory
    0 references
    efficient algorithm
    0 references
    0 references

    Identifiers