Rangierkomplexität von Permutationen

DOI10.1007/BF00571465MaRDI QIDQ2552026zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 1972

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00571465

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(1)

• The complexity of matrix transposition on one-tape off-line Turing machines

This page was built for publication: Rangierkomplexität von Permutationen

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