论文信息 - A Note on Neural Sorting Networks with O(1) Time Complexity

A Note on Neural Sorting Networks with O(1) Time Complexity

This is a follow-up note to Chen and Hsieh's recent paper [2]. It is indicated that there are two types of neural sorting networks with O(1) time complexity, both of which were published in 1990 [3,6]. The task addressed in this note is to sort numbers into nondecreasing order.

Xin Yao

[1] Wen-Tsuen Chen,et al. A neural sorting network with O(1) time complexity , 1990, IJCNN.

[2] Yoshiyasu Takefuji,et al. A super-parallel sorting algorithm based on neural networks , 1990 .

[3] Uzi Vishkin,et al. Constant Depth Reducibility , 1984, SIAM J. Comput..

[4] Jehoshua Bruck,et al. Neural computation of arithmetic functions , 1990 .

[5] Vwani P. Roychowdhury,et al. Circuit complexity for neural computation , 1991, [1991] Conference Record of the Twenty-Fifth Asilomar Conference on Signals, Systems & Computers.

[6] Yoshiyasu Takefuji. A two-step parallel sorting algorithm based on neural networks , 1990 .

[7] Jehoshua Bruck,et al. On the Power of Threshold Circuits with Small Weights , 1991, SIAM J. Discret. Math..