Designing small keyboards is hard

Theoretical Computer Science

Volumn 332, Issue 1-3, 2005, Pages 405-415

  Cardinal, Jean ^a   Langerman, Stefan ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Approximation algorithms; Combinatorial optimization; NP hardness

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; PROBABILITY; PROBLEM SOLVING; THEOREM PROVING;

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; MOBILE PHONES; NP-HARDNESS;

COMPUTER KEYBOARDS;

EID: 13644258493     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.12.004     Document Type: Article

References (12)

1. M. Bellare, M. Goldreich, and M. Sudan Free bits, PCPs and non-approximability - towards tight results SIAM J. Comput. 27 1998 804 915
2. L. Butts, A. Cockburn, An evaluation of mobile phone text input methods, in: Proc. 3rd Australasian User Interfaces Conf., 2001.
3. M. Conforti, and G. Cornuejols Submodular set functions, matroids and the greedy algorithm tight worst-case bounds and some generalizations of the rado-edmonds theorem Discrete Appl. Math. 7 1984 257 275
4. M. Garey, and D.S. Johnson Computers and Intractability A Guide to the Theory of NP-Completeness 1979 W.H. Freeman & Co New York
5. D. Hochbaum (Ed.), Approximation Algorithms for NP-hard Optimization Problems, PWS Publishing Company, New York, 1997.
6. ISO/IEC 9995-8, Information systems - keyboard layouts for text and office systems - part 8: allocation of letters to keys of a numeric keypad, International Organisation for standardisation, 1994.
7. G. Lescher, B. Moulton, and D. Higginbotham Optimal character arrangements for ambiguous keyboards IEEE Trans. Rehabil. Engrg. 6 4 1998 415 423
8. I. MacKenzie, and R. Soukoreff Text entry for mobile computing models and methods, theory and practice Hum.-Comput. Interact. 17 2002 147 198
9. B. Oommen, R. Valiveti, and J. Zgierski An adaptive learning solution to the keyboard optimization problem IEEE Trans. Systems Man Cybernet. SMC-21 1991 1608 1618 (Corrected version in IEEE Trans. Systems Man Cybernet., Vol. SMC-22, 1992, pp. 1233-1243)
10. R. Raz, S. Safra, A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP, in: Proc. 29th Ann. ACM Symp. on Theory of Computing, 1997, pp. 475-484.
11. Tegic Communications, T9 text entry, http://www.t9.com
12. V. Vazirani Approximation Algorithms 2001 Springer Berlin