COMPUTATION OF A DETERMINANT AND A MATRIX PRODUCT IN CELLULAR AUTOMATA
From MaRDI portal
Publication:5151295
DOI10.17223/20710410/46/8zbMath1458.68127OpenAlexW4240897218MaRDI QIDQ5151295
I. V. Matyushkin, Vladimir S. Kozhevnikov
Publication date: 17 February 2021
Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/pdm687
Determinants, permanents, traces, other special matrix functions (15A15) Cellular automata (computational aspects) (68Q80)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic
- On computing the determinant in small parallel time using a small number of processors
- A six-state minimal time solution to the Firing squad synchronization problem
- Megacell machine
- Gaussian elimination is not optimal
- Parallel computation of determinants of matrices with polynomial entries
- Parallel Matrix and Graph Algorithms
- Fast Parallel Matrix Inversion Algorithms
- Some Complexity Results for Matrix Computations on Parallel Processors
This page was built for publication: COMPUTATION OF A DETERMINANT AND A MATRIX PRODUCT IN CELLULAR AUTOMATA