933 search results - page 3 / 187 » Monotone Complexity of a Pair |
JDA
2008
13 years 5 months ago
2008
Partitioning a permutation into a minimum number of monotone subsequences is NP-hard. We extend this complexity result
COLT
2003
Springer
13 years 10 months ago
2003
Springer
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=−log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomon...
DALT
2007
Springer
13 years 11 months ago
2007
Springer
Development of more complex cognitive systems during evolution is sometimes viewed in relation to environmental complexity. In more detail, growth of complexity during evolution ca...
ALT
2005
Springer
14 years 2 months ago
2005
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true ...
FCT
2007
Springer
13 years 11 months ago
2007
Springer
