Dominance: consistently comparing computational complexity
Though complexity theory strives primarily to categorize problems according to their complexity, it is typically the complexity only of methods of solving problems that we can directly measure. Specifically, we have an upper bound for a problem's complexity: namely, the complexity of the most e...
| Main Author: | |
|---|---|
| Format: | Report |
| Language: | English |
| Published: |
Oxford University Computing Laboratory
2008
|
| Subjects: |