Transposition of an matrix requires (log ) reversals on conservative Turing machines

DOI10.1016/0020-0190(88)90163-9MaRDI QIDQ1111379zbMATH OpenOpenAlexFDO

Authors W. Kirchherr

Publication date 1988

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(88)90163-9

zbMATH Keywords

conservative k-tape machinematrix transpositionpeppling gameTuring machine

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Review text

We consider matrix transposition on a k-tape Turing machine which treats entries of a matrix as indivisible entities (`pebbles'). We call such a machine a conservative k-tape machine. We show that such a machine requires \(\Omega\) (log \(\ell)\) reversals to transpose an \(\ell \times \ell\) matrix.

Recommendations

• The complexity of matrix transposition on one-tape off-line Turing machines with output tape
• Optimal in-place transposition of rectangular matrices
• scientific article; zbMATH DE number 4060710
• The complexity of matrix transposition on one-tape off-line Turing machines
• scientific article; zbMATH DE number 3988711

Cites work

• A Fast Computer Method for Matrix Transposing
• Reversal Complexity

Cited in

(4)

• The complexity of matrix transposition on one-tape off-line Turing machines with output tape
• scientific article; zbMATH DE number 4060710 (Why is no real title available?)
• scientific article; zbMATH DE number 1984234 (Why is no real title available?)
• The complexity of matrix transposition on one-tape off-line Turing machines

This page was built for publication: Transposition of an \(\ell \times \ell\) matrix requires \(\Omega\) (log \(\ell)\) reversals on conservative Turing machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111379)