| http://www.w3.org/ns/prov#value | - So it is perfectly plausible that some algorithm performs particularly badly on inputs, say, less than 10^100 (a googol) in length - but then does a little better after that, and thus has better complexity - even though for all practical purposes it is terrible.
|
