A gap between the actual complexity of permutations and their entropy defined by Stoss

DOI10.1007/BF00289310MaRDI QIDQ1157902zbMATH OpenOpenAlexFDO

Authors Thomas Klingler, Stefan Reisch

Publication date 1981

Published in Acta Informatica (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Cites work

• scientific article; zbMATH DE number 3441617 (Why is no real title available?)
• Lower Bounds on Merging Networks

This page was built for publication: A gap between the actual complexity of permutations and their entropy defined by Stoss

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