2 search results - page 1 / 1 » Time-Bounded Kolmogorov Complexity and Solovay Functions |
MFCS
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...