Report
Dominance: consistently comparing computational complexity
- Abstract:
-
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 efficient known solution method for the problem. In order to improve such bounds, it is desired to consider sets of solution methods that are as complete as possible; but, whilst comparisons of computing...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Not peer reviewed
Actions
Authors
Bibliographic Details
- Publisher:
- Oxford University Computing Laboratory Publisher's website
- Publication date:
- 2008-01-01
Item Description
- Language:
- English
- Keywords:
- Subjects:
- UUID:
-
uuid:4d4ad57c-93df-4991-bdd8-f423c756f4cd
- Local pid:
- ora:4907
- Deposit date:
- 2011-02-09
Related Items
Terms of use
- Copyright holder:
- Blakey, E
- Copyright date:
- 2008
Metrics
If you are the owner of this record, you can report an update to it here: Report update to this record