A Note on polynomial-size circuits with low resource-bounded Kolmogorov complexity Montserrat HermoElvira Mayordomo OriginalPaper Pages: 347 - 356
A new polynomial-time algorithm for the maximum weighted (χ(G) — 1)-coloring problem in comparability graphs A. Hertz OriginalPaper Pages: 357 - 363
Statistical properties of finite sequences with high Kolmogorov complexity Ming LiPaul M. B. Vitányi OriginalPaper Pages: 365 - 376