Lower bounds for merging networks

DOI10.1006/INCO.2001.2934zbMath1007.68077OpenAlexW2025099704MaRDI QIDQ1854444

Shigeki Iwata

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/68e314a5699005787aaf4a48afd21090866e395d

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Some minimum merging networks

Cites Work

• Unnamed Item
• Bounds on the size of merging networks
• Lower Bounds on Merging Networks
• The asymptotic complexity of merging networks

This page was built for publication: Lower bounds for merging networks