Systematic parameterized complexity analysis in computational phonology
Many computational problems are NP-hard and hence probably do not have fast, i.e., polynomial time, algorithms. Such problems may yet have non-polynomial time algorithms, and the non-polynomial time complexities of these algorithm will be functions of particular aspects of that problem, i.e., the al...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English en |
| Published: |
2017
|
| Subjects: | |
| Online Access: | https://dspace.library.uvic.ca//handle/1828/8806 |