Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Some simplified NP-complete problems
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
A system for fast, full-text entry for small electronic devices
Proceedings of the 5th international conference on Multimodal interfaces
Improved word list ordering for text entry on ambiguous keypads
Proceedings of the 5th Nordic conference on Human-computer interaction: building bridges
| Hi-index | 0.00 |
Sending text messages on cell phones which only contain the keys 0 through 9 and # and * can be a painful experience. We consider the problem of designing an optimal mapping of numbers to sets of letters to act as an alternative to the standard {2 → {abc}, 3 → {def}...}. Our overall goal is to minimize the expected number of buttons that must be pressed to enter a message in English. Some variations of the problem are efficiently solvable, either by being small instances or by being in P, but the most realistic version of the problem is NP hard. To prove NP-completeness, we describe a new graph coloring problem UNIQUEPATHCOLORING. We also provide numerical results for the English language on a standard corpus which describe several mappings that improve upon the standard one. With luck, one of these new mappings will achieve success similar to that of the Dvorak layout for computer keyboards.