A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf
.
Kolmogorov Complexity, Complexity Cores, and the Distribution of Hardness
[chapter]
1992
Kolmogorov Complexity and Computational Complexity
Problems that are complete for exponential space are provably intractable and known to be exceedingly complex in several technical respects. However, every problem decidable in exponential space is e ciently reducible to every complete problem, so each complete problem must have a highly organized structure. The authors have recently exploited this fact to prove that complete problems are, in two respects, unusually simple for problems in expontential space. Speci cally, e v ery complete
doi:10.1007/978-3-642-77735-6_4
fatcat:xd3j2fefj5c23emuokmbn6u2oq