A note on neural sorting networks with O(1) time complexity

DOI10.1016/0020-0190(95)00159-1zbMath1004.68541OpenAlexW196713639MaRDI QIDQ1352092

Xin Yao

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00159-1

zbMATH Keywords

computational complexitysortingneural networksthreshold circuits

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• A neural sorting network with O(1) time complexity
• Constant Depth Reducibility
• On the Power of Threshold Circuits with Small Weights