Abstract
An example is provided of a sorting-type decision problem which can be solved in fewer steps by using comparisons between linear functions of the inputs, rather than comparisons between the inputs themselves. This disproves a conjecture of Yao [14] and Yap [16]. Several extensions are presented.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 321-330 |
| Number of pages | 10 |
| Journal | Theoretical Computer Science |
| Volume | 19 |
| Issue number | 3 |
| DOIs | |
| State | Published - Sep 1982 |
| Externally published | Yes |
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)