Complexity-theoretic aspects of expanding cellular automata (Q6195134): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Causal graph dynamics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On truth-table reducibility to SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast parallel language recognition by cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of constant-time cellular automata computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shrinking One-Way Cellular Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativization of questions about log space computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of polynomial time reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shrinking and Expanding Cellular Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity-theoretic aspects of expanding cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3926078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfigurable cellular computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast language acceptance by shrinking cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Computation-Universal Cellular Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel language recognition in constant time by cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph automata: Natural expression of self-reproduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Query Classes / rank
 
Normal rank

Latest revision as of 09:55, 27 August 2024

scientific article; zbMATH DE number 7805975
Language Label Description Also known as
English
Complexity-theoretic aspects of expanding cellular automata
scientific article; zbMATH DE number 7805975

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references