Introduces polynomial-complexity algorithms to compute reversibility period and verify reversibility for general 1D linear CA, with a generation method from given periods.
Shoup, New algorithms for finding irreducible polynomials over finite fields, Mathematics of Com- putation, 54(189)(1990) 435-447
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient methods to determine the reversibility of general 1D linear cellular automata in polynomial complexity
Introduces polynomial-complexity algorithms to compute reversibility period and verify reversibility for general 1D linear CA, with a generation method from given periods.