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

Xin YAO

doi:10.1016/0020-0190(95)00159-1

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

Research output: Journal Publications › Journal Article (refereed) › peer-review

Original language	English
Pages (from-to)	253-254
Number of pages	2
Journal	Information Processing Letters
Volume	56
Issue number	5
DOIs	https://doi.org/10.1016/0020-0190(95)00159-1
Publication status	Published - Dec 1995
Externally published	Yes

Keywords

Computational complexity
Neural networks
Sorting
Threshold circuits

Access to Document

10.1016/0020-0190(95)00159-1

Cite this

@article{ea5473f05f4449ea9539b4b88bee4843,

title = "A note on neural sorting networks with O(1) time complexity",

keywords = "Computational complexity, Neural networks, Sorting, Threshold circuits",

author = "Xin YAO",

year = "1995",

month = dec,

doi = "10.1016/0020-0190(95)00159-1",

language = "English",

volume = "56",

pages = "253--254",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "5",

}

TY - JOUR

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

AU - YAO, Xin

PY - 1995/12

Y1 - 1995/12

KW - Computational complexity

KW - Neural networks

KW - Sorting

KW - Threshold circuits

UR - http://www.scopus.com/inward/record.url?scp=7444228971&partnerID=8YFLogxK

U2 - 10.1016/0020-0190(95)00159-1

DO - 10.1016/0020-0190(95)00159-1

M3 - Journal Article (refereed)

SN - 0020-0190

VL - 56

SP - 253

EP - 254

JO - Information Processing Letters

JF - Information Processing Letters

IS - 5

ER -

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

Keywords

Access to Document

Other files and links

Cite this