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

DOI10.1007/BF00289310zbMath0472.68024OpenAlexW2076175976MaRDI QIDQ1157902

Stefan Reisch, Thomas Klingler

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

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

Cites Work

• Unnamed Item
• 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