On the complexity of comparison problems using linear functions

Research output: Contribution to journal › Conference article › peer-review

19 Scopus citations

Original language	English
Article number	4567862
Pages (from-to)	85-89
Number of pages	5
Journal	Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Volume	1975-October
DOIs	https://doi.org/10.1109/SFCS.1975.20
State	Published - 1975
Event	16th Annual Symposium on Foundations of Computer Science, SFCS 1975 - Berkeley, United States Duration: 13 Oct 1975 → 15 Oct 1975

Access to Document

@article{bb0845f1f8294883b920cb9da8f8f626,

title = "On the complexity of comparison problems using linear functions",

author = "Yao, \{Andrew Chi Chih\}",

year = "1975",

doi = "10.1109/SFCS.1975.20",

language = "英语",

volume = "1975-October",

pages = "85--89",

journal = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",

issn = "0272-5428",

publisher = "IEEE Computer Society",

note = "16th Annual Symposium on Foundations of Computer Science, SFCS 1975 ; Conference date: 13-10-1975 Through 15-10-1975",

}

TY - JOUR

T1 - On the complexity of comparison problems using linear functions

AU - Yao, Andrew Chi Chih

PY - 1975

Y1 - 1975

UR - https://www.scopus.com/pages/publications/85030834947

U2 - 10.1109/SFCS.1975.20

DO - 10.1109/SFCS.1975.20

M3 - 会议文章

AN - SCOPUS:85030834947

SN - 0272-5428

VL - 1975-October

SP - 85

EP - 89

JO - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

JF - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

M1 - 4567862

T2 - 16th Annual Symposium on Foundations of Computer Science, SFCS 1975

Y2 - 13 October 1975 through 15 October 1975

ER -